YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 01:32:10,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 01:32:10,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 01:32:10,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 01:32:10,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 01:32:10,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 01:32:10,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 01:32:10,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 01:32:10,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 01:32:10,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 01:32:10,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 01:32:10,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 01:32:10,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 01:32:10,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 01:32:10,077 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 01:32:10,078 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 01:32:10,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 01:32:10,081 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 01:32:10,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 01:32:10,085 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 01:32:10,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 01:32:10,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 01:32:10,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 01:32:10,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 01:32:10,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 01:32:10,091 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 01:32:10,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 01:32:10,092 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 01:32:10,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 01:32:10,093 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 01:32:10,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 01:32:10,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 01:32:10,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 01:32:10,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 01:32:10,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 01:32:10,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 01:32:10,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 01:32:10,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 01:32:10,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 01:32:10,098 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 01:32:10,113 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 01:32:10,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 01:32:10,114 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 01:32:10,114 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 01:32:10,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 01:32:10,115 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 01:32:10,115 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 01:32:10,115 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 01:32:10,115 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 01:32:10,115 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 01:32:10,116 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 01:32:10,116 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 01:32:10,116 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 01:32:10,116 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 01:32:10,116 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:32:10,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 01:32:10,117 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 01:32:10,117 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 01:32:10,117 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 01:32:10,117 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 01:32:10,117 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 01:32:10,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 01:32:10,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 01:32:10,118 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 01:32:10,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 01:32:10,118 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 01:32:10,118 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 01:32:10,118 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 01:32:10,118 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 01:32:10,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 01:32:10,157 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 01:32:10,160 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 01:32:10,162 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 01:32:10,162 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 01:32:10,163 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 01:32:10,243 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/7506031b44444efc94164561b453fc22/FLAG56311a1fb [2020-06-22 01:32:10,629 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 01:32:10,629 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 01:32:10,641 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/7506031b44444efc94164561b453fc22/FLAG56311a1fb [2020-06-22 01:32:10,974 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/7506031b44444efc94164561b453fc22 [2020-06-22 01:32:10,985 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 01:32:10,987 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 01:32:10,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 01:32:10,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 01:32:10,991 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 01:32:10,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 01:32:10" (1/1) ... [2020-06-22 01:32:10,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126c7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:10, skipping insertion in model container [2020-06-22 01:32:10,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 01:32:10" (1/1) ... [2020-06-22 01:32:11,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 01:32:11,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 01:32:11,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 01:32:11,370 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 01:32:11,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 01:32:11,459 INFO L195 MainTranslator]: Completed translation [2020-06-22 01:32:11,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11 WrapperNode [2020-06-22 01:32:11,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 01:32:11,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 01:32:11,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 01:32:11,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 01:32:11,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 01:32:11,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 01:32:11,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 01:32:11,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 01:32:11,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 01:32:11,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 01:32:11,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 01:32:11,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 01:32:11,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 01:32:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 01:32:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 01:32:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-06-22 01:32:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 01:32:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 01:32:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 01:32:11,854 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 01:32:11,854 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2020-06-22 01:32:11,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:11 BoogieIcfgContainer [2020-06-22 01:32:11,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 01:32:11,856 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 01:32:11,857 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 01:32:11,859 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 01:32:11,859 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:11" (1/1) ... [2020-06-22 01:32:11,875 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 36 edges [2020-06-22 01:32:11,877 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 01:32:11,878 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 01:32:11,878 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 01:32:11,878 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 01:32:11,881 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 01:32:11,882 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 01:32:11,882 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 01:32:11,905 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 01:32:11,933 INFO L200 BlockEncoder]: SBE split 14 edges [2020-06-22 01:32:11,940 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-06-22 01:32:11,941 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:32:11,967 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 01:32:11,970 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-06-22 01:32:11,971 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 01:32:11,972 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 01:32:11,972 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 01:32:11,972 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 01:32:11,973 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 37 edges [2020-06-22 01:32:11,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:32:11 BasicIcfg [2020-06-22 01:32:11,973 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 01:32:11,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 01:32:11,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 01:32:11,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 01:32:11,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 01:32:10" (1/4) ... [2020-06-22 01:32:11,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6955dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:32:11, skipping insertion in model container [2020-06-22 01:32:11,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (2/4) ... [2020-06-22 01:32:11,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6955dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:32:11, skipping insertion in model container [2020-06-22 01:32:11,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:11" (3/4) ... [2020-06-22 01:32:11,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6955dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:32:11, skipping insertion in model container [2020-06-22 01:32:11,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:32:11" (4/4) ... [2020-06-22 01:32:11,981 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 01:32:11,991 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 01:32:11,999 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-06-22 01:32:12,015 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-06-22 01:32:12,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 01:32:12,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 01:32:12,045 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 01:32:12,045 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 01:32:12,045 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 01:32:12,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 01:32:12,045 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 01:32:12,045 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 01:32:12,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 01:32:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-06-22 01:32:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 01:32:12,066 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:12,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 01:32:12,067 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash 5542340, now seen corresponding path program 1 times [2020-06-22 01:32:12,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:12,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:12,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:12,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:12,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:12,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:12,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 01:32:12,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 01:32:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:12,233 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-06-22 01:32:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:12,390 INFO L93 Difference]: Finished difference Result 57 states and 105 transitions. [2020-06-22 01:32:12,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 01:32:12,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 01:32:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:12,406 INFO L225 Difference]: With dead ends: 57 [2020-06-22 01:32:12,407 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 01:32:12,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 01:32:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 21. [2020-06-22 01:32:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 01:32:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2020-06-22 01:32:12,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 40 transitions. Word has length 4 [2020-06-22 01:32:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:12,450 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 40 transitions. [2020-06-22 01:32:12,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 01:32:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 40 transitions. [2020-06-22 01:32:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 01:32:12,451 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:12,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 01:32:12,451 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash 5543301, now seen corresponding path program 1 times [2020-06-22 01:32:12,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:12,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:12,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:12,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:12,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 01:32:12,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 01:32:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:12,497 INFO L87 Difference]: Start difference. First operand 21 states and 40 transitions. Second operand 3 states. [2020-06-22 01:32:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:12,564 INFO L93 Difference]: Finished difference Result 21 states and 40 transitions. [2020-06-22 01:32:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 01:32:12,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 01:32:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:12,565 INFO L225 Difference]: With dead ends: 21 [2020-06-22 01:32:12,565 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 01:32:12,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 01:32:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 01:32:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 01:32:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2020-06-22 01:32:12,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 38 transitions. Word has length 4 [2020-06-22 01:32:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:12,571 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 38 transitions. [2020-06-22 01:32:12,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 01:32:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 38 transitions. [2020-06-22 01:32:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 01:32:12,572 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:12,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 01:32:12,572 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash 5543303, now seen corresponding path program 1 times [2020-06-22 01:32:12,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:12,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:12,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:12,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:12,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:12,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:12,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 01:32:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 01:32:12,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:12,613 INFO L87 Difference]: Start difference. First operand 20 states and 38 transitions. Second operand 4 states. [2020-06-22 01:32:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:12,739 INFO L93 Difference]: Finished difference Result 20 states and 38 transitions. [2020-06-22 01:32:12,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 01:32:12,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 01:32:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:12,741 INFO L225 Difference]: With dead ends: 20 [2020-06-22 01:32:12,741 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 01:32:12,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:32:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 01:32:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 01:32:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 01:32:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2020-06-22 01:32:12,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 4 [2020-06-22 01:32:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:12,746 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 36 transitions. [2020-06-22 01:32:12,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 01:32:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 36 transitions. [2020-06-22 01:32:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 01:32:12,747 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:12,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 01:32:12,747 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1032169743, now seen corresponding path program 1 times [2020-06-22 01:32:12,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:12,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:12,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:12,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:12,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 01:32:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 01:32:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:12,801 INFO L87 Difference]: Start difference. First operand 19 states and 36 transitions. Second operand 3 states. [2020-06-22 01:32:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:12,853 INFO L93 Difference]: Finished difference Result 19 states and 36 transitions. [2020-06-22 01:32:12,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 01:32:12,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 01:32:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:12,854 INFO L225 Difference]: With dead ends: 19 [2020-06-22 01:32:12,854 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 01:32:12,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 01:32:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 01:32:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 01:32:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2020-06-22 01:32:12,859 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 6 [2020-06-22 01:32:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:12,859 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 34 transitions. [2020-06-22 01:32:12,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 01:32:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. [2020-06-22 01:32:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 01:32:12,860 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:12,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 01:32:12,860 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:12,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1032169745, now seen corresponding path program 1 times [2020-06-22 01:32:12,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:12,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:12,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:12,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:12,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:12,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 01:32:12,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 01:32:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 01:32:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 01:32:12,970 INFO L87 Difference]: Start difference. First operand 18 states and 34 transitions. Second operand 6 states. [2020-06-22 01:32:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:13,127 INFO L93 Difference]: Finished difference Result 41 states and 71 transitions. [2020-06-22 01:32:13,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 01:32:13,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-06-22 01:32:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:13,129 INFO L225 Difference]: With dead ends: 41 [2020-06-22 01:32:13,129 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 01:32:13,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 01:32:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 01:32:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2020-06-22 01:32:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 01:32:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2020-06-22 01:32:13,134 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 6 [2020-06-22 01:32:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:13,134 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. [2020-06-22 01:32:13,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 01:32:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. [2020-06-22 01:32:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 01:32:13,135 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:13,135 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:13,135 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash -222299495, now seen corresponding path program 1 times [2020-06-22 01:32:13,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:13,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:13,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 01:32:13,194 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 01:32:13,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:13,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:32:13,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:13,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 01:32:13,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2020-06-22 01:32:13,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 01:32:13,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 01:32:13,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 01:32:13,307 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand 7 states. [2020-06-22 01:32:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:13,493 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2020-06-22 01:32:13,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 01:32:13,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 01:32:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:13,494 INFO L225 Difference]: With dead ends: 45 [2020-06-22 01:32:13,494 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 01:32:13,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-06-22 01:32:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 01:32:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2020-06-22 01:32:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 01:32:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2020-06-22 01:32:13,500 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 8 [2020-06-22 01:32:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:13,500 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2020-06-22 01:32:13,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 01:32:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-06-22 01:32:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 01:32:13,501 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:13,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:13,501 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:13,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1698717933, now seen corresponding path program 1 times [2020-06-22 01:32:13,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:13,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:13,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:13,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:32:13,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:13,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:13,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 01:32:13,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 01:32:13,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:13,537 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. [2020-06-22 01:32:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:13,578 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. [2020-06-22 01:32:13,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 01:32:13,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 01:32:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:13,579 INFO L225 Difference]: With dead ends: 26 [2020-06-22 01:32:13,579 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 01:32:13,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 01:32:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 01:32:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 01:32:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. [2020-06-22 01:32:13,585 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 9 [2020-06-22 01:32:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:13,585 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 39 transitions. [2020-06-22 01:32:13,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 01:32:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2020-06-22 01:32:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 01:32:13,586 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:13,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:13,586 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:13,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1698717935, now seen corresponding path program 1 times [2020-06-22 01:32:13,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:13,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:13,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:13,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:32:13,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:13,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 01:32:13,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 01:32:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 01:32:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-06-22 01:32:13,673 INFO L87 Difference]: Start difference. First operand 23 states and 39 transitions. Second operand 6 states. [2020-06-22 01:32:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:13,754 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. [2020-06-22 01:32:13,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 01:32:13,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-06-22 01:32:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:13,755 INFO L225 Difference]: With dead ends: 24 [2020-06-22 01:32:13,755 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 01:32:13,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-06-22 01:32:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 01:32:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 01:32:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 01:32:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2020-06-22 01:32:13,761 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 9 [2020-06-22 01:32:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:13,761 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2020-06-22 01:32:13,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 01:32:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2020-06-22 01:32:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 01:32:13,762 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:13,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:13,762 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1698717936, now seen corresponding path program 1 times [2020-06-22 01:32:13,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:13,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:13,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:13,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:32:13,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:13,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 01:32:13,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 01:32:13,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 01:32:13,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:13,811 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 4 states. [2020-06-22 01:32:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:13,862 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-06-22 01:32:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 01:32:13,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-06-22 01:32:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:13,863 INFO L225 Difference]: With dead ends: 23 [2020-06-22 01:32:13,863 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 01:32:13,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 01:32:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 01:32:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 01:32:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 37 transitions. [2020-06-22 01:32:13,883 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 37 transitions. Word has length 9 [2020-06-22 01:32:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:13,883 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 37 transitions. [2020-06-22 01:32:13,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 01:32:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2020-06-22 01:32:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 01:32:13,884 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:13,884 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:13,884 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 899371689, now seen corresponding path program 1 times [2020-06-22 01:32:13,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:13,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 01:32:13,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 01:32:13,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 01:32:13,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:13,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 01:32:13,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 01:32:13,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 01:32:13,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-06-22 01:32:13,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 01:32:13,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 01:32:13,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:13,963 INFO L87 Difference]: Start difference. First operand 22 states and 37 transitions. Second operand 4 states. [2020-06-22 01:32:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:14,072 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2020-06-22 01:32:14,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 01:32:14,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-06-22 01:32:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:14,073 INFO L225 Difference]: With dead ends: 52 [2020-06-22 01:32:14,073 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 01:32:14,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 01:32:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 23. [2020-06-22 01:32:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 01:32:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2020-06-22 01:32:14,078 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 9 [2020-06-22 01:32:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:14,078 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. [2020-06-22 01:32:14,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 01:32:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. [2020-06-22 01:32:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 01:32:14,079 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:14,079 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:14,079 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1786875370, now seen corresponding path program 1 times [2020-06-22 01:32:14,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:14,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:14,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:14,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 01:32:14,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 01:32:14,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 01:32:14,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:14,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 01:32:14,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:14,233 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 01:32:14,234 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 01:32:14,243 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 01:32:14,249 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2020-06-22 01:32:14,250 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 01:32:14,260 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 01:32:14,261 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 01:32:14,261 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:25 [2020-06-22 01:32:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:14,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 01:32:14,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 8 [2020-06-22 01:32:14,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 01:32:14,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 01:32:14,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-06-22 01:32:14,355 INFO L87 Difference]: Start difference. First operand 23 states and 40 transitions. Second operand 9 states. [2020-06-22 01:32:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:14,679 INFO L93 Difference]: Finished difference Result 44 states and 69 transitions. [2020-06-22 01:32:14,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 01:32:14,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2020-06-22 01:32:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:14,681 INFO L225 Difference]: With dead ends: 44 [2020-06-22 01:32:14,681 INFO L226 Difference]: Without dead ends: 37 [2020-06-22 01:32:14,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-06-22 01:32:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-06-22 01:32:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2020-06-22 01:32:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 01:32:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. [2020-06-22 01:32:14,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 41 transitions. Word has length 9 [2020-06-22 01:32:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:14,688 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 41 transitions. [2020-06-22 01:32:14,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 01:32:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 41 transitions. [2020-06-22 01:32:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 01:32:14,689 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:14,689 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:14,689 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1786875371, now seen corresponding path program 1 times [2020-06-22 01:32:14,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:14,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:14,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:32:14,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:14,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:14,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 01:32:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 01:32:14,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:14,717 INFO L87 Difference]: Start difference. First operand 25 states and 41 transitions. Second operand 3 states. [2020-06-22 01:32:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:14,762 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2020-06-22 01:32:14,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 01:32:14,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 01:32:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:14,763 INFO L225 Difference]: With dead ends: 25 [2020-06-22 01:32:14,763 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 01:32:14,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 01:32:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 01:32:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 01:32:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2020-06-22 01:32:14,769 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 9 [2020-06-22 01:32:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:14,769 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 40 transitions. [2020-06-22 01:32:14,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 01:32:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 40 transitions. [2020-06-22 01:32:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 01:32:14,770 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:14,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:14,770 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:14,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1120646875, now seen corresponding path program 1 times [2020-06-22 01:32:14,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:14,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:32:14,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:14,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:14,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 01:32:14,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 01:32:14,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:14,801 INFO L87 Difference]: Start difference. First operand 24 states and 40 transitions. Second operand 4 states. [2020-06-22 01:32:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:14,873 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-06-22 01:32:14,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 01:32:14,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 01:32:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:14,874 INFO L225 Difference]: With dead ends: 28 [2020-06-22 01:32:14,875 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 01:32:14,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:32:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 01:32:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2020-06-22 01:32:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 01:32:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-06-22 01:32:14,881 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 10 [2020-06-22 01:32:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:14,881 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-06-22 01:32:14,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 01:32:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-06-22 01:32:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 01:32:14,882 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:14,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:14,882 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1120646876, now seen corresponding path program 1 times [2020-06-22 01:32:14,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:14,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:14,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:14,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:32:14,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:14,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:14,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 01:32:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 01:32:14,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:14,911 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 4 states. [2020-06-22 01:32:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:14,967 INFO L93 Difference]: Finished difference Result 24 states and 39 transitions. [2020-06-22 01:32:14,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 01:32:14,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 01:32:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:14,967 INFO L225 Difference]: With dead ends: 24 [2020-06-22 01:32:14,968 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 01:32:14,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:32:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 01:32:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-06-22 01:32:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 01:32:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2020-06-22 01:32:14,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2020-06-22 01:32:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:14,972 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2020-06-22 01:32:14,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 01:32:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2020-06-22 01:32:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 01:32:14,973 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:14,973 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:14,973 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:14,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash 980196670, now seen corresponding path program 1 times [2020-06-22 01:32:14,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:14,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:14,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:14,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 01:32:15,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:15,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 01:32:15,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 01:32:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 01:32:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:32:15,015 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 5 states. [2020-06-22 01:32:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:15,060 INFO L93 Difference]: Finished difference Result 18 states and 29 transitions. [2020-06-22 01:32:15,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 01:32:15,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-06-22 01:32:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:15,061 INFO L225 Difference]: With dead ends: 18 [2020-06-22 01:32:15,061 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 01:32:15,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:32:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 01:32:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-06-22 01:32:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 01:32:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2020-06-22 01:32:15,066 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 12 [2020-06-22 01:32:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:15,066 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 28 transitions. [2020-06-22 01:32:15,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 01:32:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. [2020-06-22 01:32:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 01:32:15,067 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:15,067 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:15,067 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:15,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:15,067 INFO L82 PathProgramCache]: Analyzing trace with hash 980196669, now seen corresponding path program 1 times [2020-06-22 01:32:15,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:15,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:15,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 01:32:15,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:15,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 01:32:15,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 01:32:15,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 01:32:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 01:32:15,116 INFO L87 Difference]: Start difference. First operand 16 states and 28 transitions. Second operand 5 states. [2020-06-22 01:32:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:15,180 INFO L93 Difference]: Finished difference Result 17 states and 28 transitions. [2020-06-22 01:32:15,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 01:32:15,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-06-22 01:32:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:15,181 INFO L225 Difference]: With dead ends: 17 [2020-06-22 01:32:15,182 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 01:32:15,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-06-22 01:32:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 01:32:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 01:32:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 01:32:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-06-22 01:32:15,186 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 12 [2020-06-22 01:32:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:15,186 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-06-22 01:32:15,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 01:32:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-06-22 01:32:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 01:32:15,187 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 01:32:15,187 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:15,187 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 01:32:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1371175179, now seen corresponding path program 1 times [2020-06-22 01:32:15,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:15,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:15,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:15,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-06-22 01:32:15,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:15,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:15,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 01:32:15,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 01:32:15,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:15,213 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. [2020-06-22 01:32:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:15,246 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-06-22 01:32:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 01:32:15,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-06-22 01:32:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 01:32:15,247 INFO L225 Difference]: With dead ends: 16 [2020-06-22 01:32:15,247 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 01:32:15,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 01:32:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 01:32:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 01:32:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 01:32:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 01:32:15,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-06-22 01:32:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 01:32:15,248 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:32:15,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 01:32:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 01:32:15,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 01:32:15,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 01:32:15,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 01:32:15,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 01:32:15,493 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2020-06-22 01:32:15,717 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2020-06-22 01:32:15,720 INFO L448 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2020-06-22 01:32:15,721 INFO L448 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2020-06-22 01:32:15,721 INFO L448 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2020-06-22 01:32:15,721 INFO L448 ceAbstractionStarter]: For program point L626(line 626) no Hoare annotation was computed. [2020-06-22 01:32:15,721 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 629) no Hoare annotation was computed. [2020-06-22 01:32:15,721 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 01:32:15,721 INFO L444 ceAbstractionStarter]: At program point L633-2(lines 633 635) the Hoare annotation is: (or (and (<= 1 ~n~0) (= ~a~0.offset 0)) (<= 2 ~n~0)) [2020-06-22 01:32:15,721 INFO L448 ceAbstractionStarter]: For program point L633-3(lines 633 635) no Hoare annotation was computed. [2020-06-22 01:32:15,722 INFO L444 ceAbstractionStarter]: At program point L627-2(lines 627 628) the Hoare annotation is: (let ((.cse9 (select |#length| ~b~0.base)) (.cse10 (select |#length| ~a~0.base)) (.cse8 (* 4 ~n~0))) (let ((.cse0 (= 1 (select |#valid| ~b~0.base))) (.cse6 (* 4 ULTIMATE.start_foo_~i~0)) (.cse1 (= .cse10 .cse8)) (.cse2 (= .cse9 .cse8)) (.cse3 (= ~a~0.offset 0)) (.cse4 (= 1 (select |#valid| ~a~0.base))) (.cse7 (<= 4 ~b~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((~n~0 Int) (|ULTIMATE.start_main_#t~post6.base| Int)) (let ((.cse5 (* 4 ~n~0))) (and (= .cse5 (select |#length| ~a~0.base)) (= .cse5 (select |#length| |ULTIMATE.start_main_#t~post6.base|)) (not (= ~a~0.base |ULTIMATE.start_main_#t~post6.base|)) (<= 2 ~n~0)))) (<= 4 (+ .cse6 ~b~0.offset)) .cse7 (<= (+ .cse8 ~b~0.offset) (+ .cse9 4))) (and .cse0 (<= (+ .cse6 4) .cse10) .cse1 .cse2 (<= 0 ULTIMATE.start_foo_~i~0) .cse3 (<= ~n~0 1) .cse4 .cse7 (<= ~b~0.offset .cse8))))) [2020-06-22 01:32:15,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. [2020-06-22 01:32:15,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. [2020-06-22 01:32:15,722 INFO L444 ceAbstractionStarter]: At program point L625-2(lines 625 626) the Hoare annotation is: (let ((.cse9 (select |#length| ~b~0.base)) (.cse6 (* 4 ~n~0))) (let ((.cse0 (= 1 (select |#valid| ~b~0.base))) (.cse1 (= .cse9 .cse6)) (.cse2 (= (select |#length| ~a~0.base) .cse6)) (.cse3 (= ~a~0.offset 0)) (.cse4 (= 1 (select |#valid| ~a~0.base))) (.cse7 (exists ((~n~0 Int) (|ULTIMATE.start_main_#t~post6.base| Int)) (let ((.cse10 (* 4 ~n~0))) (and (= .cse10 (select |#length| ~a~0.base)) (= .cse10 (select |#length| |ULTIMATE.start_main_#t~post6.base|)) (not (= ~a~0.base |ULTIMATE.start_main_#t~post6.base|)) (<= 2 ~n~0))))) (.cse5 (<= 4 ~b~0.offset)) (.cse8 (<= (+ .cse6 ~b~0.offset) (+ .cse9 4)))) (or (and .cse0 .cse1 .cse2 (<= 0 ULTIMATE.start_foo_~i~0) .cse3 (<= ~n~0 1) .cse4 .cse5 (<= ~b~0.offset .cse6)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 4 (+ ~a~0.offset (* 4 ULTIMATE.start_foo_~i~0))) .cse7 .cse5 .cse8) (and .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_foo_~i~0) .cse3 .cse4 .cse7 .cse5 .cse8)))) [2020-06-22 01:32:15,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 628) no Hoare annotation was computed. [2020-06-22 01:32:15,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 628) no Hoare annotation was computed. [2020-06-22 01:32:15,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. [2020-06-22 01:32:15,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 640) no Hoare annotation was computed. [2020-06-22 01:32:15,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 626) no Hoare annotation was computed. [2020-06-22 01:32:15,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 626) no Hoare annotation was computed. [2020-06-22 01:32:15,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 638) no Hoare annotation was computed. [2020-06-22 01:32:15,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 638) no Hoare annotation was computed. [2020-06-22 01:32:15,723 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 01:32:15,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,747 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:15,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:15,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,764 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:15,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:32:15 BasicIcfg [2020-06-22 01:32:15,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 01:32:15,767 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 01:32:15,767 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 01:32:15,771 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 01:32:15,772 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:32:15,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 01:32:10" (1/5) ... [2020-06-22 01:32:15,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e149824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 01:32:15, skipping insertion in model container [2020-06-22 01:32:15,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:32:15,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 01:32:11" (2/5) ... [2020-06-22 01:32:15,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e149824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 01:32:15, skipping insertion in model container [2020-06-22 01:32:15,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:32:15,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:11" (3/5) ... [2020-06-22 01:32:15,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e149824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:32:15, skipping insertion in model container [2020-06-22 01:32:15,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:32:15,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 01:32:11" (4/5) ... [2020-06-22 01:32:15,774 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e149824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:32:15, skipping insertion in model container [2020-06-22 01:32:15,774 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 01:32:15,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:32:15" (5/5) ... [2020-06-22 01:32:15,776 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 01:32:15,796 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 01:32:15,796 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 01:32:15,796 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 01:32:15,796 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 01:32:15,796 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 01:32:15,797 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 01:32:15,797 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 01:32:15,797 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 01:32:15,797 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 01:32:15,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-06-22 01:32:15,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-06-22 01:32:15,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:32:15,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:32:15,810 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 01:32:15,810 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 01:32:15,810 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 01:32:15,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-06-22 01:32:15,812 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 5 [2020-06-22 01:32:15,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:32:15,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:32:15,812 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 01:32:15,812 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 01:32:15,817 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 6#L633-2true [2020-06-22 01:32:15,817 INFO L796 eck$LassoCheckResult]: Loop: 6#L633-2true [123] L633-2-->L633-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_5|) (= (+ v_~n~0_5 1) v_~n~0_4) (< v_~n~0_5 30)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 6#L633-2true [2020-06-22 01:32:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash 182, now seen corresponding path program 1 times [2020-06-22 01:32:15,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:15,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:15,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:15,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash 154, now seen corresponding path program 1 times [2020-06-22 01:32:15,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:15,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:15,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:15,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:15,847 INFO L82 PathProgramCache]: Analyzing trace with hash 5765, now seen corresponding path program 1 times [2020-06-22 01:32:15,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:15,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:15,880 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:32:15,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:32:15,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:32:15,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:32:15,882 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 01:32:15,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:32:15,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:32:15,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:32:15,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 01:32:15,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:32:15,883 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:32:15,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:15,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:15,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:15,935 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:32:15,936 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-06-22 01:32:15,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 01:32:15,943 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 01:32:15,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 01:32:15,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 01:32:16,015 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 01:32:16,017 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:32:16,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:32:16,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:32:16,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:32:16,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:32:16,018 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:32:16,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:32:16,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:32:16,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 01:32:16,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:32:16,019 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:32:16,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,050 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:32:16,056 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:32:16,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:16,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:16,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:32:16,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:16,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:16,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:16,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:32:16,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:32:16,066 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:32:16,070 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 01:32:16,071 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 01:32:16,073 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:32:16,073 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 01:32:16,074 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:32:16,074 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n~0) = -2*~n~0 + 59 Supporting invariants [] [2020-06-22 01:32:16,075 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 01:32:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:16,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 01:32:16,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:16,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:32:16,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:16,115 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 01:32:16,119 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 01:32:16,120 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states. Second operand 2 states. [2020-06-22 01:32:16,268 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states.. Second operand 2 states. Result 39 states and 77 transitions. Complement of second has 4 states. [2020-06-22 01:32:16,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 01:32:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 01:32:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2020-06-22 01:32:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 1 letters. Loop has 1 letters. [2020-06-22 01:32:16,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 2 letters. Loop has 1 letters. [2020-06-22 01:32:16,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:16,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 01:32:16,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:16,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 77 transitions. [2020-06-22 01:32:16,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-06-22 01:32:16,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 9 states and 19 transitions. [2020-06-22 01:32:16,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 01:32:16,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 01:32:16,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 19 transitions. [2020-06-22 01:32:16,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:32:16,284 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. [2020-06-22 01:32:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 19 transitions. [2020-06-22 01:32:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 01:32:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 01:32:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 19 transitions. [2020-06-22 01:32:16,286 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. [2020-06-22 01:32:16,286 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 19 transitions. [2020-06-22 01:32:16,286 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 01:32:16,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 19 transitions. [2020-06-22 01:32:16,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-06-22 01:32:16,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:32:16,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:32:16,287 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 01:32:16,287 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 01:32:16,288 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 92#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 94#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 89#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 90#L625-2 [2020-06-22 01:32:16,288 INFO L796 eck$LassoCheckResult]: Loop: 90#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 93#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 90#L625-2 [2020-06-22 01:32:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash 5543293, now seen corresponding path program 1 times [2020-06-22 01:32:16,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:16,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:16,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:16,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:16,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash 3657, now seen corresponding path program 1 times [2020-06-22 01:32:16,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:16,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1032139973, now seen corresponding path program 1 times [2020-06-22 01:32:16,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:16,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:16,582 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-06-22 01:32:16,649 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:32:16,649 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:32:16,649 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:32:16,649 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:32:16,649 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:32:16,649 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:32:16,650 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:32:16,650 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:32:16,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 01:32:16,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:32:16,650 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:32:16,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:16,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:17,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:32:17,110 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:32:17,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:17,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:17,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:32:17,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:17,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:17,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:17,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:32:17,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:32:17,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:32:17,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:17,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:17,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:32:17,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:17,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:17,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:17,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:32:17,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:32:17,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:32:17,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:17,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:17,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:32:17,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:17,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:17,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:17,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:32:17,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:32:17,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:32:17,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:17,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:17,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 01:32:17,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:17,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:17,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:17,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 01:32:17,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 01:32:17,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:32:17,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:17,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:17,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:17,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:17,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:17,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:32:17,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:32:17,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:32:17,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:17,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:17,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:17,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:17,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:17,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:32:17,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:32:17,155 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:32:17,193 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-06-22 01:32:17,193 INFO L444 ModelExtractionUtils]: 22 out of 34 variables were initially zero. Simplification set additionally 9 variables to zero. [2020-06-22 01:32:17,195 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:32:17,196 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 01:32:17,196 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:32:17,196 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_foo_~i~0, ~n~0) = -1*ULTIMATE.start_foo_~i~0 + 1*~n~0 Supporting invariants [] [2020-06-22 01:32:17,215 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-06-22 01:32:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:17,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 01:32:17,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:17,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:32:17,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:17,282 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 01:32:17,282 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 01:32:17,282 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 19 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-06-22 01:32:17,311 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 19 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 12 states and 24 transitions. Complement of second has 4 states. [2020-06-22 01:32:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 01:32:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 01:32:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-06-22 01:32:17,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 01:32:17,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:17,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 01:32:17,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:17,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 01:32:17,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:17,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 24 transitions. [2020-06-22 01:32:17,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 01:32:17,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 22 transitions. [2020-06-22 01:32:17,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 01:32:17,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 01:32:17,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 22 transitions. [2020-06-22 01:32:17,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:32:17,318 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 22 transitions. [2020-06-22 01:32:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 22 transitions. [2020-06-22 01:32:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-06-22 01:32:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 01:32:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2020-06-22 01:32:17,319 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. [2020-06-22 01:32:17,319 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 21 transitions. [2020-06-22 01:32:17,319 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 01:32:17,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 21 transitions. [2020-06-22 01:32:17,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 01:32:17,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:32:17,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:32:17,320 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 01:32:17,321 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 01:32:17,321 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 176#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 179#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 173#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 174#L625-2 [153] L625-2-->L627-2: Formula: (and (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21) (= 0 v_ULTIMATE.start_foo_~i~0_20)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 172#L627-2 [2020-06-22 01:32:17,321 INFO L796 eck$LassoCheckResult]: Loop: 172#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 171#L628 [155] L628-->L627-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (let ((.cse0 (+ v_~b~0.offset_13 .cse1))) (and (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) .cse0 v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse1 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_~b~0.base_16))))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 172#L627-2 [2020-06-22 01:32:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,322 INFO L82 PathProgramCache]: Analyzing trace with hash 171842236, now seen corresponding path program 1 times [2020-06-22 01:32:17,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:17,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:17,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:17,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 01:32:17,344 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 01:32:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,344 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 1 times [2020-06-22 01:32:17,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:17,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 01:32:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:17,382 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-06-22 01:32:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:17,417 INFO L93 Difference]: Finished difference Result 13 states and 23 transitions. [2020-06-22 01:32:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 01:32:17,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 23 transitions. [2020-06-22 01:32:17,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 01:32:17,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 23 transitions. [2020-06-22 01:32:17,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-06-22 01:32:17,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 01:32:17,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 23 transitions. [2020-06-22 01:32:17,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:32:17,421 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-06-22 01:32:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 23 transitions. [2020-06-22 01:32:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2020-06-22 01:32:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 01:32:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2020-06-22 01:32:17,422 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 20 transitions. [2020-06-22 01:32:17,423 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 20 transitions. [2020-06-22 01:32:17,423 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 01:32:17,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 20 transitions. [2020-06-22 01:32:17,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 01:32:17,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:32:17,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:32:17,424 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:17,424 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 01:32:17,424 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 206#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 209#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 203#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 204#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 207#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 208#L625-2 [153] L625-2-->L627-2: Formula: (and (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21) (= 0 v_ULTIMATE.start_foo_~i~0_20)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 202#L627-2 [2020-06-22 01:32:17,425 INFO L796 eck$LassoCheckResult]: Loop: 202#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 201#L628 [155] L628-->L627-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (let ((.cse0 (+ v_~b~0.offset_13 .cse1))) (and (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) .cse0 v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse1 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_~b~0.base_16))))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 202#L627-2 [2020-06-22 01:32:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1931568244, now seen corresponding path program 1 times [2020-06-22 01:32:17,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:17,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,441 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 2 times [2020-06-22 01:32:17,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 811213185, now seen corresponding path program 1 times [2020-06-22 01:32:17,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:32:17,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 01:32:17,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 01:32:17,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 01:32:17,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 01:32:17,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 01:32:17,507 INFO L87 Difference]: Start difference. First operand 10 states and 20 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-06-22 01:32:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:17,555 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2020-06-22 01:32:17,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 01:32:17,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 29 transitions. [2020-06-22 01:32:17,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 01:32:17,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 18 transitions. [2020-06-22 01:32:17,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 01:32:17,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 01:32:17,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. [2020-06-22 01:32:17,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:32:17,560 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 01:32:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. [2020-06-22 01:32:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 01:32:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 01:32:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-06-22 01:32:17,561 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 01:32:17,561 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. [2020-06-22 01:32:17,561 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 01:32:17,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. [2020-06-22 01:32:17,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 01:32:17,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:32:17,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:32:17,562 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:17,562 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 01:32:17,563 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 242#L633-2 [124] L633-2-->L633-2: Formula: (and (= (+ v_~n~0_5 1) v_~n~0_4) (< v_~n~0_5 30) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 245#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 246#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 239#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 240#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 243#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 244#L625-2 [153] L625-2-->L627-2: Formula: (and (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21) (= 0 v_ULTIMATE.start_foo_~i~0_20)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 238#L627-2 [2020-06-22 01:32:17,563 INFO L796 eck$LassoCheckResult]: Loop: 238#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 237#L628 [155] L628-->L627-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (let ((.cse0 (+ v_~b~0.offset_13 .cse1))) (and (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) .cse0 v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse1 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_~b~0.base_16))))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 238#L627-2 [2020-06-22 01:32:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1359863364, now seen corresponding path program 1 times [2020-06-22 01:32:17,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:17,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 01:32:17,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 01:32:17,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:17,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 01:32:17,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:17,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 01:32:17,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-06-22 01:32:17,690 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 01:32:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 3 times [2020-06-22 01:32:17,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 01:32:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 01:32:17,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2020-06-22 01:32:17,728 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-06-22 01:32:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 01:32:17,817 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2020-06-22 01:32:17,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 01:32:17,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 25 transitions. [2020-06-22 01:32:17,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 01:32:17,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 25 transitions. [2020-06-22 01:32:17,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 01:32:17,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 01:32:17,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2020-06-22 01:32:17,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:32:17,822 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-06-22 01:32:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2020-06-22 01:32:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2020-06-22 01:32:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 01:32:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2020-06-22 01:32:17,823 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 20 transitions. [2020-06-22 01:32:17,823 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 20 transitions. [2020-06-22 01:32:17,823 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 01:32:17,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 20 transitions. [2020-06-22 01:32:17,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 01:32:17,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 01:32:17,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 01:32:17,824 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 01:32:17,825 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 01:32:17,825 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY [151] ULTIMATE.startENTRY-->L633-2: Formula: (and (= 0 v_~a~0.offset_7) (= 0 v_~b~0.base_15) (= 0 v_~a~0.base_8) (= v_~n~0_16 1) (= |v_#NULL.offset_2| 0) (= v_~b~0.offset_12 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_23| 0 0) |v_#valid_22|)) InVars {#valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_3|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_4|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_3|, ~a~0.offset=v_~a~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_3|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_6|, #NULL.base=|v_#NULL.base_2|, ~b~0.base=v_~b~0.base_15, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_7|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_7|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_7|, ~a~0.base=v_~a~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~b~0.offset=v_~b~0.offset_12, #valid=|v_#valid_22|, ~n~0=v_~n~0_16, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~post6.offset, #NULL.base, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ~a~0.base, ULTIMATE.start_main_#res, ~b~0.offset, #valid, ~n~0, ULTIMATE.start_main_#t~malloc5.offset] 303#L633-2 [124] L633-2-->L633-2: Formula: (and (= (+ v_~n~0_5 1) v_~n~0_4) (< v_~n~0_5 30) (> 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {~n~0=v_~n~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_#t~post3=|v_ULTIMATE.start_main_#t~post3_2|, ~n~0=v_~n~0_4, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~post3, ~n~0] 306#L633-2 [122] L633-2-->L633-3: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet2_3|) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2] 307#L633-3 [127] L633-3-->L638: Formula: (let ((.cse1 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2| 1))) (and (= v_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_2|) (= |v_ULTIMATE.start_main_#t~malloc5.offset_2| |v_ULTIMATE.start_main_#t~post6.offset_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc4.base_2|)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (let ((.cse0 (* 4 v_~n~0_6))) (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc4.base_2| .cse0) |v_ULTIMATE.start_main_#t~malloc5.base_2| .cse0)) |v_#length_1|) (= v_~b~0.offset_2 (+ |v_ULTIMATE.start_main_#t~post6.offset_2| 4)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= v_~b~0.base_2 |v_ULTIMATE.start_main_#t~post6.base_2|) (= |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_ULTIMATE.start_main_#t~post6.base_2|) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_2|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (= (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ~n~0=v_~n~0_6, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_2|, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_2|, ~a~0.offset=v_~a~0.offset_2, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_2|, ~b~0.base=v_~b~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_2|, ~a~0.base=v_~a~0.base_2, #valid=|v_#valid_3|, ~b~0.offset=v_~b~0.offset_2, #length=|v_#length_1|, ~n~0=v_~n~0_6, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ~b~0.base, ULTIMATE.start_main_#t~post6.base, ~a~0.base, #valid, ~b~0.offset, ULTIMATE.start_main_#t~malloc4.base, ~a~0.offset, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~post6.offset, ULTIMATE.start_main_#t~malloc5.offset] 300#L638 [152] L638-->L625-2: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_#t~post6.base_9|) |v_ULTIMATE.start_main_#t~post6.offset_8| v_~n~0_18)) |v_#memory_int_9|) (= 1 (select |v_#valid_24| |v_ULTIMATE.start_main_#t~post6.base_9|)) (<= 0 |v_ULTIMATE.start_main_#t~post6.offset_8|) (<= (+ |v_ULTIMATE.start_main_#t~post6.offset_8| 4) (select |v_#length_14| |v_ULTIMATE.start_main_#t~post6.base_9|)) (= 0 v_ULTIMATE.start_foo_~i~0_19)) InVars {ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|, ~n~0=v_~n~0_18, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_8|} OutVars{ULTIMATE.start_main_#t~post6.base=|v_ULTIMATE.start_main_#t~post6.base_8|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_4|, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_4|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_19, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_main_#t~post6.offset=|v_ULTIMATE.start_main_#t~post6.offset_7|, ~n~0=v_~n~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6.base, ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int, ULTIMATE.start_main_#t~post6.offset] 301#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 308#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 309#L625-2 [82] L625-2-->L626: Formula: (< v_ULTIMATE.start_foo_~i~0_7 v_~n~0_9) InVars {~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} OutVars{~n~0=v_~n~0_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_7} AuxVars[] AssignedVars[] 304#L626 [154] L626-->L625-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_foo_~i~0_23))) (let ((.cse1 (+ .cse0 v_~a~0.offset_8))) (and (<= (+ .cse0 v_~a~0.offset_8 4) (select |v_#length_15| v_~a~0.base_9)) (= (+ v_ULTIMATE.start_foo_~i~0_23 1) v_ULTIMATE.start_foo_~i~0_22) (= (select |v_#valid_25| v_~a~0.base_9) 1) (= |v_#memory_int_11| (store |v_#memory_int_12| v_~a~0.base_9 (store (select |v_#memory_int_12| v_~a~0.base_9) .cse1 v_~n~0_20))) (<= 0 .cse1)))) InVars {~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_23, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} OutVars{~a~0.base=v_~a~0.base_9, ULTIMATE.start_foo_#t~post0=|v_ULTIMATE.start_foo_#t~post0_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_22, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ~a~0.offset=v_~a~0.offset_8, #length=|v_#length_15|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post0, ULTIMATE.start_foo_~i~0, #memory_int] 305#L625-2 [153] L625-2-->L627-2: Formula: (and (<= v_~n~0_19 v_ULTIMATE.start_foo_~i~0_21) (= 0 v_ULTIMATE.start_foo_~i~0_20)) InVars {ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_21, ~n~0=v_~n~0_19} OutVars{ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_20, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[ULTIMATE.start_foo_~i~0] 299#L627-2 [2020-06-22 01:32:17,826 INFO L796 eck$LassoCheckResult]: Loop: 299#L627-2 [78] L627-2-->L628: Formula: (< (+ v_ULTIMATE.start_foo_~i~0_14 1) v_~n~0_12) InVars {~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} OutVars{~n~0=v_~n~0_12, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_14} AuxVars[] AssignedVars[] 298#L628 [155] L628-->L627-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_foo_~i~0_25))) (let ((.cse0 (+ v_~b~0.offset_13 .cse1))) (and (= v_ULTIMATE.start_foo_~i~0_24 (+ v_ULTIMATE.start_foo_~i~0_25 1)) (= (store |v_#memory_int_14| v_~b~0.base_16 (store (select |v_#memory_int_14| v_~b~0.base_16) .cse0 v_~n~0_21)) |v_#memory_int_13|) (<= (+ v_~b~0.offset_13 .cse1 4) (select |v_#length_16| v_~b~0.base_16)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_~b~0.base_16))))) InVars {~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_25, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|, ~n~0=v_~n~0_21} OutVars{~b~0.base=v_~b~0.base_16, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_foo_~i~0=v_ULTIMATE.start_foo_~i~0_24, ~b~0.offset=v_~b~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_13|, #length=|v_#length_16|, ~n~0=v_~n~0_21} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_~i~0, #memory_int] 299#L627-2 [2020-06-22 01:32:17,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1158571516, now seen corresponding path program 2 times [2020-06-22 01:32:17,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:32:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,843 INFO L82 PathProgramCache]: Analyzing trace with hash 3534, now seen corresponding path program 4 times [2020-06-22 01:32:17,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:32:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 990699785, now seen corresponding path program 1 times [2020-06-22 01:32:17,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 01:32:17,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 01:32:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 01:32:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 01:32:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 01:32:18,274 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2020-06-22 01:32:18,369 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 01:32:18,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 01:32:18,369 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 01:32:18,369 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 01:32:18,369 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 01:32:18,370 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 01:32:18,370 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 01:32:18,370 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 01:32:18,370 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 01:32:18,370 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 01:32:18,370 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 01:32:18,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,528 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-06-22 01:32:18,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 01:32:18,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 01:32:18,824 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 01:32:18,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:18,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:18,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:18,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:18,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:18,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:32:18,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:32:18,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:32:18,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:18,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:18,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:18,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:18,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:18,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:32:18,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:32:18,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 01:32:18,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 01:32:18,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 01:32:18,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 01:32:18,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 01:32:18,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 01:32:18,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 01:32:18,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 01:32:18,857 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 01:32:18,881 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 01:32:18,882 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2020-06-22 01:32:18,882 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 01:32:18,883 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 01:32:18,883 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 01:32:18,883 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_foo_~i~0, ~n~0) = -1*ULTIMATE.start_foo_~i~0 + 1*~n~0 Supporting invariants [] [2020-06-22 01:32:18,908 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-06-22 01:32:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 01:32:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:18,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 01:32:18,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 01:32:18,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 01:32:18,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 01:32:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 01:32:18,968 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 01:32:18,968 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 01:32:18,969 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states and 20 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 01:32:18,987 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states and 20 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 14 states and 23 transitions. Complement of second has 4 states. [2020-06-22 01:32:18,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 01:32:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 01:32:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-06-22 01:32:18,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 2 letters. [2020-06-22 01:32:18,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:18,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2020-06-22 01:32:18,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:18,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2020-06-22 01:32:18,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 01:32:18,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 23 transitions. [2020-06-22 01:32:18,992 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:32:18,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2020-06-22 01:32:18,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 01:32:18,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 01:32:18,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 01:32:18,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 01:32:18,993 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:32:18,993 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:32:18,993 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 01:32:18,993 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 01:32:18,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 01:32:18,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 01:32:18,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 01:32:18,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 01:32:18 BasicIcfg [2020-06-22 01:32:18,999 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 01:32:19,000 INFO L168 Benchmark]: Toolchain (without parser) took 8013.92 ms. Allocated memory was 649.6 MB in the beginning and 848.3 MB in the end (delta: 198.7 MB). Free memory was 563.9 MB in the beginning and 651.4 MB in the end (delta: -87.5 MB). Peak memory consumption was 111.2 MB. Max. memory is 50.3 GB. [2020-06-22 01:32:19,000 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 01:32:19,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.88 ms. Allocated memory was 649.6 MB in the beginning and 666.4 MB in the end (delta: 16.8 MB). Free memory was 563.9 MB in the beginning and 613.4 MB in the end (delta: -49.5 MB). Peak memory consumption was 32.2 MB. Max. memory is 50.3 GB. [2020-06-22 01:32:19,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.09 ms. Allocated memory is still 666.4 MB. Free memory was 613.4 MB in the beginning and 612.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 01:32:19,002 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 ms. Allocated memory is still 666.4 MB. Free memory was 612.0 MB in the beginning and 609.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 01:32:19,002 INFO L168 Benchmark]: RCFGBuilder took 319.08 ms. Allocated memory is still 666.4 MB. Free memory was 609.3 MB in the beginning and 585.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. [2020-06-22 01:32:19,003 INFO L168 Benchmark]: BlockEncodingV2 took 116.86 ms. Allocated memory is still 666.4 MB. Free memory was 585.8 MB in the beginning and 577.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-06-22 01:32:19,003 INFO L168 Benchmark]: TraceAbstraction took 3792.44 ms. Allocated memory was 666.4 MB in the beginning and 742.4 MB in the end (delta: 76.0 MB). Free memory was 576.4 MB in the beginning and 396.4 MB in the end (delta: 180.0 MB). Peak memory consumption was 256.0 MB. Max. memory is 50.3 GB. [2020-06-22 01:32:19,004 INFO L168 Benchmark]: BuchiAutomizer took 3232.01 ms. Allocated memory was 742.4 MB in the beginning and 848.3 MB in the end (delta: 105.9 MB). Free memory was 396.4 MB in the beginning and 651.4 MB in the end (delta: -255.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 01:32:19,008 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 36 edges - StatisticsResult: Encoded RCFG 20 locations, 37 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 586.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 472.88 ms. Allocated memory was 649.6 MB in the beginning and 666.4 MB in the end (delta: 16.8 MB). Free memory was 563.9 MB in the beginning and 613.4 MB in the end (delta: -49.5 MB). Peak memory consumption was 32.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 47.09 ms. Allocated memory is still 666.4 MB. Free memory was 613.4 MB in the beginning and 612.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 28.37 ms. Allocated memory is still 666.4 MB. Free memory was 612.0 MB in the beginning and 609.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 319.08 ms. Allocated memory is still 666.4 MB. Free memory was 609.3 MB in the beginning and 585.8 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 116.86 ms. Allocated memory is still 666.4 MB. Free memory was 585.8 MB in the beginning and 577.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3792.44 ms. Allocated memory was 666.4 MB in the beginning and 742.4 MB in the end (delta: 76.0 MB). Free memory was 576.4 MB in the beginning and 396.4 MB in the end (delta: 180.0 MB). Peak memory consumption was 256.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3232.01 ms. Allocated memory was 742.4 MB in the beginning and 848.3 MB in the end (delta: 105.9 MB). Free memory was 396.4 MB in the beginning and 651.4 MB in the end (delta: -255.0 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: (1 <= n && a == 0) || 2 <= n - InvariantResult [Line: 627]: Loop Invariant [2020-06-22 01:32:19,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[b] && unknown-#length-unknown[a] == 4 * n) && unknown-#length-unknown[b] == 4 * n) && a == 0) && 1 == \valid[a]) && (\exists ~n~0 : int, ULTIMATE.start_main_#t~post6.base : int :: ((4 * ~n~0 == unknown-#length-unknown[a] && 4 * ~n~0 == unknown-#length-unknown[ULTIMATE.start_main_#t~post6.base]) && !(a == ULTIMATE.start_main_#t~post6.base)) && 2 <= ~n~0)) && 4 <= 4 * i + b) && 4 <= b) && 4 * n + b <= unknown-#length-unknown[b] + 4) || (((((((((1 == \valid[b] && 4 * i + 4 <= unknown-#length-unknown[a]) && unknown-#length-unknown[a] == 4 * n) && unknown-#length-unknown[b] == 4 * n) && 0 <= i) && a == 0) && n <= 1) && 1 == \valid[a]) && 4 <= b) && b <= 4 * n) - InvariantResult [Line: 625]: Loop Invariant [2020-06-22 01:32:19,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,029 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,029 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~post6.base,QUANTIFIED] [2020-06-22 01:32:19,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~n~0,QUANTIFIED] [2020-06-22 01:32:19,032 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,032 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,032 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,032 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 01:32:19,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((1 == \valid[b] && unknown-#length-unknown[b] == 4 * n) && unknown-#length-unknown[a] == 4 * n) && 0 <= i) && a == 0) && n <= 1) && 1 == \valid[a]) && 4 <= b) && b <= 4 * n) || ((((((((1 == \valid[b] && unknown-#length-unknown[b] == 4 * n) && unknown-#length-unknown[a] == 4 * n) && a == 0) && 1 == \valid[a]) && 4 <= a + 4 * i) && (\exists ~n~0 : int, ULTIMATE.start_main_#t~post6.base : int :: ((4 * ~n~0 == unknown-#length-unknown[a] && 4 * ~n~0 == unknown-#length-unknown[ULTIMATE.start_main_#t~post6.base]) && !(a == ULTIMATE.start_main_#t~post6.base)) && 2 <= ~n~0)) && 4 <= b) && 4 * n + b <= unknown-#length-unknown[b] + 4)) || ((((((((1 == \valid[b] && unknown-#length-unknown[b] == 4 * n) && unknown-#length-unknown[a] == 4 * n) && 0 == i) && a == 0) && 1 == \valid[a]) && (\exists ~n~0 : int, ULTIMATE.start_main_#t~post6.base : int :: ((4 * ~n~0 == unknown-#length-unknown[a] && 4 * ~n~0 == unknown-#length-unknown[ULTIMATE.start_main_#t~post6.base]) && !(a == ULTIMATE.start_main_#t~post6.base)) && 2 <= ~n~0)) && 4 <= b) && 4 * n + b <= unknown-#length-unknown[b] + 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 10 error locations. SAFE Result, 3.6s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 425 SDslu, 183 SDs, 0 SdLazy, 972 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 67 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 13 NumberOfFragments, 318 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1320 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 274 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 150 ConstructedInterpolants, 5 QuantifiedInterpolants, 6522 SizeOfPredicates, 8 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 35/41 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -2 * n + 59 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + n and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 141 SDslu, 25 SDs, 0 SdLazy, 241 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp86 ukn86 mio100 lsp84 div100 bol100 ite100 ukn100 eq167 hnf92 smp98 dnf100 smp100 tf106 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 01:32:07.752 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 01:32:19.259 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check