./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:07:22,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:07:22,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:07:22,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:07:22,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:07:22,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:07:22,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:07:22,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:07:22,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:07:22,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:07:22,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:07:22,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:07:22,744 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:07:22,744 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:07:22,746 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:07:22,746 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:07:22,746 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:07:22,747 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:07:22,747 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:07:22,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:07:22,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:07:22,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:07:22,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:07:22,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:07:22,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:07:22,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:07:22,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:07:22,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:07:22,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:07:22,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:07:22,754 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:07:22,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:07:22,754 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:07:22,754 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:07:22,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:07:22,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:07:22,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:07:22,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:07:22,756 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:07:22,756 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2407fc1341f915e07c0451c9d94952a51e657d88233cd0bc37ed2523188f0c82 [2024-10-13 17:07:23,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:07:23,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:07:23,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:07:23,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:07:23,042 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:07:23,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2024-10-13 17:07:24,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:07:24,684 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:07:24,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2024-10-13 17:07:24,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e848a25af/ad19f861ab99472088e0aac37ec5b6c9/FLAG428a8dd04 [2024-10-13 17:07:24,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e848a25af/ad19f861ab99472088e0aac37ec5b6c9 [2024-10-13 17:07:24,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:07:24,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:07:24,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:07:24,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:07:24,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:07:24,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:07:24" (1/1) ... [2024-10-13 17:07:24,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32575688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:24, skipping insertion in model container [2024-10-13 17:07:24,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:07:24" (1/1) ... [2024-10-13 17:07:24,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:07:25,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:07:25,064 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:07:25,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:07:25,146 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:07:25,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25 WrapperNode [2024-10-13 17:07:25,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:07:25,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:07:25,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:07:25,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:07:25,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,183 INFO L138 Inliner]: procedures = 115, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2024-10-13 17:07:25,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:07:25,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:07:25,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:07:25,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:07:25,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,208 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-13 17:07:25,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:07:25,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:07:25,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:07:25,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:07:25,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (1/1) ... [2024-10-13 17:07:25,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:25,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:25,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:25,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-13 17:07:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:07:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:07:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:07:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:07:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:07:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:07:25,404 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:07:25,406 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:07:25,534 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-13 17:07:25,534 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:07:25,544 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:07:25,544 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 17:07:25,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:07:25 BoogieIcfgContainer [2024-10-13 17:07:25,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:07:25,545 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:07:25,545 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:07:25,548 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:07:25,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:07:25,549 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:07:24" (1/3) ... [2024-10-13 17:07:25,549 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c87c74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:07:25, skipping insertion in model container [2024-10-13 17:07:25,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:07:25,550 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:07:25" (2/3) ... [2024-10-13 17:07:25,550 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c87c74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:07:25, skipping insertion in model container [2024-10-13 17:07:25,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:07:25,550 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:07:25" (3/3) ... [2024-10-13 17:07:25,551 INFO L332 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-1.i [2024-10-13 17:07:25,594 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:07:25,594 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:07:25,594 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:07:25,594 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:07:25,594 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:07:25,594 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:07:25,594 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:07:25,595 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:07:25,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:25,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-13 17:07:25,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:25,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:25,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 17:07:25,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:07:25,625 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:07:25,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:25,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-13 17:07:25,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:25,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:25,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-13 17:07:25,627 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:07:25,633 INFO L745 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 18#L516true assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 16#L516-2true call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 10#L518true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 11#L519-3true [2024-10-13 17:07:25,633 INFO L747 eck$LassoCheckResult]: Loop: 11#L519-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12#L521true assume main_~val~0#1 < 0;main_~val~0#1 := 0; 7#L521-2true call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8#L519-2true main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11#L519-3true [2024-10-13 17:07:25,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2024-10-13 17:07:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:25,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617089497] [2024-10-13 17:07:25,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:25,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:25,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:25,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2024-10-13 17:07:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011844285] [2024-10-13 17:07:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:25,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:25,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:25,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2024-10-13 17:07:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:25,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521824217] [2024-10-13 17:07:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:25,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:25,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:26,222 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:26,224 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:26,224 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:26,224 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:26,225 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:26,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:26,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:26,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:26,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration1_Lasso [2024-10-13 17:07:26,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:26,226 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:26,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:26,731 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:26,735 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:26,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:26,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:26,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:26,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-13 17:07:26,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:26,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:26,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:26,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:26,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:26,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:26,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:26,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:26,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:26,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-13 17:07:26,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:26,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:26,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-13 17:07:26,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:26,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:26,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:26,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:26,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:26,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:26,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:26,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:26,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:26,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-13 17:07:26,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:26,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:26,815 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:26,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-13 17:07:26,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:26,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:26,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:26,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:26,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:26,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:26,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:26,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:26,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:26,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-13 17:07:26,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:26,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:26,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-13 17:07:26,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:26,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:26,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:26,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:26,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:26,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:26,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:26,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:26,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:26,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-13 17:07:26,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:26,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:26,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-13 17:07:26,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:26,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:26,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:26,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:26,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:26,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:26,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:26,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:26,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 17:07:26,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:26,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:26,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:26,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-13 17:07:26,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:26,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:26,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:26,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:26,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:26,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:26,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:26,974 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:27,009 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-13 17:07:27,010 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-10-13 17:07:27,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:27,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:27,046 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:27,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-13 17:07:27,050 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:27,062 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:27,062 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:27,063 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~length~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-13 17:07:27,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-13 17:07:27,085 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-13 17:07:27,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:27,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:07:27,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:27,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:07:27,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:27,221 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:07:27,223 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:27,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 48 transitions. Complement of second has 6 states. [2024-10-13 17:07:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2024-10-13 17:07:27,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-13 17:07:27,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:27,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 4 letters. [2024-10-13 17:07:27,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:27,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 8 letters. [2024-10-13 17:07:27,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:27,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 48 transitions. [2024-10-13 17:07:27,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:07:27,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 15 states and 21 transitions. [2024-10-13 17:07:27,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:27,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:07:27,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2024-10-13 17:07:27,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:07:27,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-13 17:07:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2024-10-13 17:07:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-13 17:07:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2024-10-13 17:07:27,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-13 17:07:27,316 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2024-10-13 17:07:27,316 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:07:27,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2024-10-13 17:07:27,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:07:27,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:27,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:27,318 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:27,318 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:07:27,319 INFO L745 eck$LassoCheckResult]: Stem: 128#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 123#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 129#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 124#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 125#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 126#L519-4 main_~j~0#1 := 0; 116#L526-3 [2024-10-13 17:07:27,319 INFO L747 eck$LassoCheckResult]: Loop: 116#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 118#L527-3 assume !true; 115#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 116#L526-3 [2024-10-13 17:07:27,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2024-10-13 17:07:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549099025] [2024-10-13 17:07:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:27,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549099025] [2024-10-13 17:07:27,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549099025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:07:27,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:07:27,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:07:27,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645999578] [2024-10-13 17:07:27,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:07:27,422 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:27,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 72876, now seen corresponding path program 1 times [2024-10-13 17:07:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:27,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860070970] [2024-10-13 17:07:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860070970] [2024-10-13 17:07:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860070970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:07:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:07:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:07:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256296875] [2024-10-13 17:07:27,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:07:27,431 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:07:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 17:07:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 17:07:27,434 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:27,438 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-13 17:07:27,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2024-10-13 17:07:27,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:07:27,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2024-10-13 17:07:27,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:27,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:07:27,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2024-10-13 17:07:27,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:07:27,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-13 17:07:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2024-10-13 17:07:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-13 17:07:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-10-13 17:07:27,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-13 17:07:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 17:07:27,445 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-13 17:07:27,445 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:07:27,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2024-10-13 17:07:27,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:07:27,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:27,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:27,448 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:27,448 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:07:27,448 INFO L745 eck$LassoCheckResult]: Stem: 165#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 160#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 166#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 161#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 162#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 163#L519-4 main_~j~0#1 := 0; 153#L526-3 [2024-10-13 17:07:27,448 INFO L747 eck$LassoCheckResult]: Loop: 153#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 155#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 154#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 152#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 153#L526-3 [2024-10-13 17:07:27,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 2 times [2024-10-13 17:07:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:27,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179040752] [2024-10-13 17:07:27,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179040752] [2024-10-13 17:07:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179040752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:07:27,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:07:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:07:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178880028] [2024-10-13 17:07:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:07:27,544 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:27,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:27,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2024-10-13 17:07:27,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:27,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115289047] [2024-10-13 17:07:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:27,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:27,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:27,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-13 17:07:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:07:27,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:07:27,644 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:27,672 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-10-13 17:07:27,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2024-10-13 17:07:27,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:07:27,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2024-10-13 17:07:27,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:27,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:07:27,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2024-10-13 17:07:27,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:07:27,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-10-13 17:07:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2024-10-13 17:07:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2024-10-13 17:07:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-10-13 17:07:27,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 17:07:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:07:27,681 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-10-13 17:07:27,682 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:07:27,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-10-13 17:07:27,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-13 17:07:27,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:27,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:27,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:27,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:07:27,683 INFO L745 eck$LassoCheckResult]: Stem: 205#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 199#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 200#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 206#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 201#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 202#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 203#L521 assume !(main_~val~0#1 < 0); 196#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 197#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 198#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 204#L519-4 main_~j~0#1 := 0; 193#L526-3 [2024-10-13 17:07:27,683 INFO L747 eck$LassoCheckResult]: Loop: 193#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 195#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 194#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 192#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 193#L526-3 [2024-10-13 17:07:27,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:27,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2024-10-13 17:07:27,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:27,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244959874] [2024-10-13 17:07:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:27,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:27,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:27,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2024-10-13 17:07:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445729355] [2024-10-13 17:07:27,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:27,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:27,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:27,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2024-10-13 17:07:27,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:27,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3693331] [2024-10-13 17:07:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:27,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:27,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:27,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:28,051 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:28,052 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:28,052 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:28,052 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:28,052 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:28,052 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:28,052 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:28,052 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:28,053 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration4_Lasso [2024-10-13 17:07:28,053 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:28,053 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:28,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:28,443 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:28,443 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:28,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:28,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:28,446 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:28,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-13 17:07:28,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:28,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:28,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:28,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:28,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:28,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:28,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:28,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:28,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:28,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-13 17:07:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:28,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:28,476 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:28,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-13 17:07:28,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:28,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:28,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:28,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:28,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:28,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:28,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:28,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:28,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:28,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-13 17:07:28,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:28,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:28,504 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:28,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-13 17:07:28,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:28,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:28,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:28,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:28,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:28,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:28,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:28,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:28,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:28,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:28,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:28,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:28,530 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:28,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-13 17:07:28,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:28,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:28,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:28,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:28,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:28,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:28,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:28,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:28,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:28,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-13 17:07:28,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:28,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:28,561 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:28,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-13 17:07:28,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:28,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:28,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:28,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:28,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:28,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:28,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:28,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:28,609 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-13 17:07:28,609 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-13 17:07:28,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:28,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:28,611 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:28,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-13 17:07:28,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:28,629 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:28,630 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:28,630 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_2, ULTIMATE.start_main_~arr~0#1.offset, ULTIMATE.start_main_~j~0#1) = 2*v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_2 - 1*ULTIMATE.start_main_~arr~0#1.offset - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2024-10-13 17:07:28,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:28,653 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2024-10-13 17:07:28,657 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-13 17:07:28,658 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-13 17:07:28,658 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~arr~0!offset [2024-10-13 17:07:28,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:28,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 17:07:28,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:28,742 WARN L253 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:07:28,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:28,793 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-10-13 17:07:28,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:28,843 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 27 transitions. Complement of second has 7 states. [2024-10-13 17:07:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2024-10-13 17:07:28,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2024-10-13 17:07:28,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:28,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2024-10-13 17:07:28,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:28,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2024-10-13 17:07:28,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:28,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-10-13 17:07:28,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:28,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 26 transitions. [2024-10-13 17:07:28,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:28,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-10-13 17:07:28,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2024-10-13 17:07:28,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:28,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-13 17:07:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2024-10-13 17:07:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-10-13 17:07:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-13 17:07:28,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-13 17:07:28,852 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-13 17:07:28,852 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:07:28,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2024-10-13 17:07:28,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:28,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:28,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:28,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:28,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:28,855 INFO L745 eck$LassoCheckResult]: Stem: 330#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 324#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 325#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 331#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 326#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 327#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 328#L521 assume !(main_~val~0#1 < 0); 321#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 322#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 323#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 329#L519-4 main_~j~0#1 := 0; 320#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 317#L527-3 [2024-10-13 17:07:28,855 INFO L747 eck$LassoCheckResult]: Loop: 317#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 316#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 317#L527-3 [2024-10-13 17:07:28,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2024-10-13 17:07:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:28,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283368633] [2024-10-13 17:07:28,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:28,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:28,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:28,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:28,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2024-10-13 17:07:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:28,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599730688] [2024-10-13 17:07:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:28,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:28,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:28,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:28,907 INFO L85 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2024-10-13 17:07:28,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:28,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111295013] [2024-10-13 17:07:28,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:28,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:28,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:28,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:29,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-13 17:07:29,166 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:29,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:29,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:29,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:29,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:29,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:29,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:29,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:29,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration5_Lasso [2024-10-13 17:07:29,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:29,167 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:29,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:29,504 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:29,508 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:29,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:29,510 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:29,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-13 17:07:29,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:29,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:29,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:29,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:29,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:29,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:29,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:29,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:29,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-13 17:07:29,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:29,552 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:29,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 17:07:29,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:29,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:29,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:29,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:29,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:29,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:29,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:29,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:29,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-13 17:07:29,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:29,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:29,592 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:29,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 17:07:29,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:29,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:29,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:29,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:29,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:29,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:29,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:29,617 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:29,636 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-13 17:07:29,636 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:07:29,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:29,638 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:29,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 17:07:29,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:29,656 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:29,657 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:29,657 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 0)_2 Supporting invariants [] [2024-10-13 17:07:29,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-13 17:07:29,684 INFO L156 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2024-10-13 17:07:29,686 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:07:29,686 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:07:29,686 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:07:29,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:29,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:07:29,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:29,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:29,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:29,815 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-10-13 17:07:29,815 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:29,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 35 transitions. Complement of second has 9 states. [2024-10-13 17:07:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2024-10-13 17:07:29,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2024-10-13 17:07:29,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:29,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2024-10-13 17:07:29,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:29,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2024-10-13 17:07:29,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:29,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2024-10-13 17:07:29,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:29,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 28 transitions. [2024-10-13 17:07:29,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:29,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:29,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-10-13 17:07:29,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:29,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-13 17:07:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-10-13 17:07:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-10-13 17:07:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-13 17:07:29,880 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-13 17:07:29,880 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-13 17:07:29,880 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:07:29,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-10-13 17:07:29,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:29,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:29,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:29,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:29,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:29,881 INFO L745 eck$LassoCheckResult]: Stem: 469#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 462#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 463#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 470#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 464#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 465#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 466#L521 assume !(main_~val~0#1 < 0); 459#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 460#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 461#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 467#L519-4 main_~j~0#1 := 0; 457#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 456#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 471#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 451#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 452#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 454#L527-3 [2024-10-13 17:07:29,881 INFO L747 eck$LassoCheckResult]: Loop: 454#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 453#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 454#L527-3 [2024-10-13 17:07:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2024-10-13 17:07:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464676985] [2024-10-13 17:07:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464676985] [2024-10-13 17:07:29,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464676985] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:07:29,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051355129] [2024-10-13 17:07:29,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:07:29,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:07:29,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:29,986 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:07:29,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-13 17:07:30,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:07:30,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:07:30,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:07:30,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:30,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:07:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:30,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051355129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:07:30,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:07:30,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-13 17:07:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738519928] [2024-10-13 17:07:30,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:07:30,133 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:30,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2024-10-13 17:07:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529296057] [2024-10-13 17:07:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:30,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:30,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:30,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 17:07:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-13 17:07:30,180 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 10 Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:30,268 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-10-13 17:07:30,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2024-10-13 17:07:30,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:30,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 28 states and 35 transitions. [2024-10-13 17:07:30,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:30,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:30,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2024-10-13 17:07:30,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:30,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-13 17:07:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2024-10-13 17:07:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-10-13 17:07:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-10-13 17:07:30,272 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-13 17:07:30,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 17:07:30,273 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-13 17:07:30,273 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:07:30,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2024-10-13 17:07:30,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:30,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:30,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:30,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:30,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:30,274 INFO L745 eck$LassoCheckResult]: Stem: 646#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 640#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 647#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 641#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 642#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 643#L521 assume !(main_~val~0#1 < 0); 651#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 637#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 638#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 644#L521 assume !(main_~val~0#1 < 0); 635#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 636#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 650#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 648#L519-4 main_~j~0#1 := 0; 633#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 632#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 649#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 627#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 628#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 630#L527-3 [2024-10-13 17:07:30,274 INFO L747 eck$LassoCheckResult]: Loop: 630#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 629#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 630#L527-3 [2024-10-13 17:07:30,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2024-10-13 17:07:30,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:30,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067346303] [2024-10-13 17:07:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:30,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:30,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:30,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2024-10-13 17:07:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:30,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007055540] [2024-10-13 17:07:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:30,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:30,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:30,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:30,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:30,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2024-10-13 17:07:30,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:30,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241720140] [2024-10-13 17:07:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:30,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:30,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:30,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:30,616 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:30,616 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:30,616 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:30,617 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:30,617 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:30,617 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:30,617 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:30,617 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:30,617 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration7_Lasso [2024-10-13 17:07:30,617 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:30,617 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:30,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:30,941 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:30,941 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:30,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:30,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:30,943 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:30,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 17:07:30,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:30,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:30,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:30,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:30,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:30,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:30,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:30,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:30,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:30,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-13 17:07:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:30,970 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:30,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 17:07:30,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:30,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:30,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:30,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:30,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:30,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:30,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:30,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:31,001 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-13 17:07:31,002 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:07:31,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:31,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:31,004 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:31,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 17:07:31,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:31,022 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:31,023 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:31,023 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 4)_1 Supporting invariants [] [2024-10-13 17:07:31,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-13 17:07:31,051 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:07:31,053 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:07:31,054 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:07:31,054 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:07:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:31,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:07:31,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:31,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:31,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:31,221 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-13 17:07:31,221 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:31,253 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 5 states. [2024-10-13 17:07:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:07:31,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-13 17:07:31,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:31,255 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:31,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:31,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:07:31,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:31,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:31,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:31,422 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-13 17:07:31,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:31,449 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 5 states. [2024-10-13 17:07:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:07:31,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-13 17:07:31,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:31,450 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:31,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:07:31,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:31,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:31,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:31,615 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-13 17:07:31,615 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:31,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 50 transitions. Complement of second has 11 states. [2024-10-13 17:07:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:07:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2024-10-13 17:07:31,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 2 letters. [2024-10-13 17:07:31,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:31,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 22 letters. Loop has 2 letters. [2024-10-13 17:07:31,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:31,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 4 letters. [2024-10-13 17:07:31,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:31,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2024-10-13 17:07:31,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:31,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 43 transitions. [2024-10-13 17:07:31,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:31,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:07:31,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2024-10-13 17:07:31,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:31,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-10-13 17:07:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2024-10-13 17:07:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-10-13 17:07:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-13 17:07:31,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-13 17:07:31,695 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-13 17:07:31,695 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:07:31,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2024-10-13 17:07:31,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:31,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:31,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:31,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:31,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:31,697 INFO L745 eck$LassoCheckResult]: Stem: 1049#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1041#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1042#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1050#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1043#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1044#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1045#L521 assume !(main_~val~0#1 < 0); 1038#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1039#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1040#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1046#L521 assume !(main_~val~0#1 < 0); 1054#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1053#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1052#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 1051#L519-4 main_~j~0#1 := 0; 1035#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1036#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1056#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1055#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1037#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1034#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1058#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1029#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1030#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1032#L527-3 [2024-10-13 17:07:31,697 INFO L747 eck$LassoCheckResult]: Loop: 1032#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1031#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1032#L527-3 [2024-10-13 17:07:31,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1808436561, now seen corresponding path program 4 times [2024-10-13 17:07:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:31,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030401533] [2024-10-13 17:07:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:31,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:31,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030401533] [2024-10-13 17:07:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030401533] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:07:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475830517] [2024-10-13 17:07:31,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 17:07:31,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:07:31,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:31,839 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:07:31,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-13 17:07:31,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 17:07:31,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:07:31,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:07:31,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:31,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:07:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:32,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475830517] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:07:32,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:07:32,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-10-13 17:07:32,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143510672] [2024-10-13 17:07:32,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:07:32,027 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:32,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 4 times [2024-10-13 17:07:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435474551] [2024-10-13 17:07:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:32,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:32,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:32,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 17:07:32,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-13 17:07:32,070 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. cyclomatic complexity: 12 Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:32,143 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-13 17:07:32,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2024-10-13 17:07:32,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:32,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 46 transitions. [2024-10-13 17:07:32,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:32,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:32,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2024-10-13 17:07:32,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:32,145 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-10-13 17:07:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2024-10-13 17:07:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-10-13 17:07:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-10-13 17:07:32,147 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-13 17:07:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 17:07:32,148 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-13 17:07:32,148 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 17:07:32,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2024-10-13 17:07:32,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:32,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:32,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:32,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:32,150 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:32,150 INFO L745 eck$LassoCheckResult]: Stem: 1283#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1275#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1284#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1276#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1277#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1278#L521 assume !(main_~val~0#1 < 0); 1296#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1295#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1279#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1280#L521 assume !(main_~val~0#1 < 0); 1271#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1272#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1273#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1287#L521 assume !(main_~val~0#1 < 0); 1294#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1288#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1286#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 1285#L519-4 main_~j~0#1 := 0; 1269#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1270#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1291#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1263#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1264#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1268#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1292#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1290#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1289#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1266#L527-3 [2024-10-13 17:07:32,150 INFO L747 eck$LassoCheckResult]: Loop: 1266#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1265#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1266#L527-3 [2024-10-13 17:07:32,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash -759828824, now seen corresponding path program 5 times [2024-10-13 17:07:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:32,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554606277] [2024-10-13 17:07:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:32,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:32,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:32,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:32,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 5 times [2024-10-13 17:07:32,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:32,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110938655] [2024-10-13 17:07:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:32,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:32,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:32,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:32,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -51058003, now seen corresponding path program 2 times [2024-10-13 17:07:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131961789] [2024-10-13 17:07:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:32,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:32,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:32,604 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:32,604 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:32,604 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:32,604 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:32,605 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:32,605 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:32,605 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:32,605 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:32,605 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration9_Lasso [2024-10-13 17:07:32,605 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:32,605 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:32,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:32,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:33,081 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:33,081 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:33,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,084 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 17:07:33,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,109 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 17:07:33,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,135 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-13 17:07:33,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,159 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-13 17:07:33,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,171 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-13 17:07:33,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,183 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-13 17:07:33,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,197 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,210 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-13 17:07:33,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,244 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-13 17:07:33,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:33,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:33,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,272 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-13 17:07:33,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:33,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:33,288 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,305 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-13 17:07:33,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,336 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-13 17:07:33,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,349 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,360 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-13 17:07:33,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-13 17:07:33,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,384 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-13 17:07:33,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,409 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-13 17:07:33,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:33,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:33,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:33,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-13 17:07:33,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,436 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-13 17:07:33,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:33,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:33,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,468 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-13 17:07:33,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:33,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:33,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-13 17:07:33,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,498 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-13 17:07:33,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:33,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:33,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-13 17:07:33,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,525 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-13 17:07:33,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:33,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:33,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:33,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,554 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-13 17:07:33,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:33,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:33,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:33,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:33,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:33,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:33,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:33,575 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:33,588 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-13 17:07:33,588 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:07:33,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:33,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:33,591 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:33,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-13 17:07:33,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:33,609 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:33,609 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:33,609 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 8))_1 Supporting invariants [] [2024-10-13 17:07:33,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:33,628 INFO L156 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2024-10-13 17:07:33,630 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:07:33,630 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:07:33,630 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:07:33,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:33,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:07:33,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:33,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:33,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:33,754 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-13 17:07:33,754 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:33,776 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 4 states. [2024-10-13 17:07:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:07:33,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 28 letters. Loop has 2 letters. [2024-10-13 17:07:33,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:33,777 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:33,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:33,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:07:33,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:33,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:33,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:33,900 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-13 17:07:33,900 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:33,919 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 44 transitions. Complement of second has 4 states. [2024-10-13 17:07:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:07:33,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 28 letters. Loop has 2 letters. [2024-10-13 17:07:33,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:33,920 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:33,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:33,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 17:07:33,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:34,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:34,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:34,045 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-10-13 17:07:34,045 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:34,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 13. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 63 transitions. Complement of second has 12 states. [2024-10-13 17:07:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:07:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2024-10-13 17:07:34,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 2 letters. [2024-10-13 17:07:34,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:34,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 30 letters. Loop has 2 letters. [2024-10-13 17:07:34,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:34,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 28 letters. Loop has 4 letters. [2024-10-13 17:07:34,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:34,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 63 transitions. [2024-10-13 17:07:34,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:34,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 45 states and 56 transitions. [2024-10-13 17:07:34,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:34,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:07:34,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2024-10-13 17:07:34,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:34,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-10-13 17:07:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2024-10-13 17:07:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-10-13 17:07:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-10-13 17:07:34,129 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-13 17:07:34,129 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-13 17:07:34,129 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 17:07:34,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2024-10-13 17:07:34,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:34,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:34,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:34,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:34,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:34,131 INFO L745 eck$LassoCheckResult]: Stem: 1792#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1785#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1786#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 1793#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 1787#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1788#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1789#L521 assume !(main_~val~0#1 < 0); 1803#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1783#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1784#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1790#L521 assume !(main_~val~0#1 < 0); 1781#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1782#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1799#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1796#L521 assume !(main_~val~0#1 < 0); 1798#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1797#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1795#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 1794#L519-4 main_~j~0#1 := 0; 1778#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1779#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1805#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1806#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1780#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1777#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1791#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1772#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1773#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1808#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1804#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 1802#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1800#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 1775#L527-3 [2024-10-13 17:07:34,131 INFO L747 eck$LassoCheckResult]: Loop: 1775#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1774#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1775#L527-3 [2024-10-13 17:07:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1822100739, now seen corresponding path program 6 times [2024-10-13 17:07:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359501721] [2024-10-13 17:07:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359501721] [2024-10-13 17:07:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359501721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:07:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531890561] [2024-10-13 17:07:34,258 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 17:07:34,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:07:34,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:34,260 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:07:34,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-10-13 17:07:34,322 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-10-13 17:07:34,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:07:34,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:07:34,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:34,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:07:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531890561] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:07:34,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:07:34,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-10-13 17:07:34,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325350256] [2024-10-13 17:07:34,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:07:34,506 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:34,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 6 times [2024-10-13 17:07:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988505437] [2024-10-13 17:07:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:34,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:34,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:34,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:34,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 17:07:34,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-13 17:07:34,562 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 15 Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:34,645 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-10-13 17:07:34,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2024-10-13 17:07:34,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:34,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 46 states and 57 transitions. [2024-10-13 17:07:34,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:34,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:34,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 57 transitions. [2024-10-13 17:07:34,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:34,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-10-13 17:07:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 57 transitions. [2024-10-13 17:07:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-10-13 17:07:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-10-13 17:07:34,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-13 17:07:34,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 17:07:34,651 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-13 17:07:34,651 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 17:07:34,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2024-10-13 17:07:34,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:34,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:34,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:34,652 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:34,652 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:34,653 INFO L745 eck$LassoCheckResult]: Stem: 2100#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2092#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2093#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 2101#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2094#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2095#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2096#L521 assume !(main_~val~0#1 < 0); 2122#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2121#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2097#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2098#L521 assume !(main_~val~0#1 < 0); 2089#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2090#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2091#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2120#L521 assume !(main_~val~0#1 < 0); 2119#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2118#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2117#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2104#L521 assume !(main_~val~0#1 < 0); 2116#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2105#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2103#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 2102#L519-4 main_~j~0#1 := 0; 2086#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2087#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2110#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2111#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2088#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2085#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2099#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2080#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2081#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2114#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2109#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2108#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2106#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2083#L527-3 [2024-10-13 17:07:34,653 INFO L747 eck$LassoCheckResult]: Loop: 2083#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2082#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2083#L527-3 [2024-10-13 17:07:34,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:34,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1774872054, now seen corresponding path program 7 times [2024-10-13 17:07:34,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:34,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108976822] [2024-10-13 17:07:34,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:34,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:34,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:34,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:34,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 7 times [2024-10-13 17:07:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:34,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399445120] [2024-10-13 17:07:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:34,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:34,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:34,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:34,697 INFO L85 PathProgramCache]: Analyzing trace with hash 550028923, now seen corresponding path program 3 times [2024-10-13 17:07:34,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:34,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209862048] [2024-10-13 17:07:34,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:34,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:34,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:35,378 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:35,378 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:35,378 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:35,378 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:35,378 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:35,378 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,378 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:35,378 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:35,378 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration11_Lasso [2024-10-13 17:07:35,378 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:35,378 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:35,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:35,787 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:35,788 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:35,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:35,790 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:35,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-13 17:07:35,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:35,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:35,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:35,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:35,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:35,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:35,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:35,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:35,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:35,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:35,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:35,820 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:35,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-13 17:07:35,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:35,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:35,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:35,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:35,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:35,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:35,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:35,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:35,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:35,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-13 17:07:35,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:35,844 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:35,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-13 17:07:35,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:35,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:35,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:35,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:35,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:35,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:35,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:35,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:35,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:35,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-13 17:07:35,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:35,869 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:35,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-13 17:07:35,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:35,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:35,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:35,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:35,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:35,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:35,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:35,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:35,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:35,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-13 17:07:35,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:35,894 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:35,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-13 17:07:35,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:35,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:35,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:35,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:35,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:35,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:35,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:35,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:35,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:35,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:35,921 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:35,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-13 17:07:35,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:35,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:35,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:35,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:35,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:35,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:35,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:35,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:35,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:35,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-13 17:07:35,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:35,945 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:35,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-13 17:07:35,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:35,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:35,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:35,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:35,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:35,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:35,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:35,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:35,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-13 17:07:35,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:35,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:35,971 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:35,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-13 17:07:35,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:35,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:35,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:35,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:35,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:35,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:35,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:35,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:36,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:36,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,016 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-13 17:07:36,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:36,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:36,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:36,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-10-13 17:07:36,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,041 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-13 17:07:36,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:36,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:36,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:36,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-13 17:07:36,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,065 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-13 17:07:36,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:36,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:36,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:36,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:36,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,089 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-13 17:07:36,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:36,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:36,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:36,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-13 17:07:36,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,114 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-13 17:07:36,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:36,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:36,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:36,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-13 17:07:36,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,141 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-13 17:07:36,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:36,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:36,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-13 17:07:36,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,167 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-13 17:07:36,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:36,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:36,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:36,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,194 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-10-13 17:07:36,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:36,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:36,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-10-13 17:07:36,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,220 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-10-13 17:07:36,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:36,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:36,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:36,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,260 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-10-13 17:07:36,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:36,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:36,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:36,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-10-13 17:07:36,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,288 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-10-13 17:07:36,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:36,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:36,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:36,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:36,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:36,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:36,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:36,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:36,316 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-13 17:07:36,316 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:07:36,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:36,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:36,318 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:36,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-10-13 17:07:36,319 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:36,330 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:36,330 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:36,330 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 12))_1 Supporting invariants [] [2024-10-13 17:07:36,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-10-13 17:07:36,352 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-10-13 17:07:36,353 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:07:36,353 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:07:36,353 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:07:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:36,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:07:36,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:36,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:36,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:36,498 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-13 17:07:36,498 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:36,516 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 55 transitions. Complement of second has 4 states. [2024-10-13 17:07:36,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:07:36,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 36 letters. Loop has 2 letters. [2024-10-13 17:07:36,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:36,519 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:36,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:36,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:07:36,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:36,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:36,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:36,649 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-13 17:07:36,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:36,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 55 transitions. Complement of second has 4 states. [2024-10-13 17:07:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:07:36,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 36 letters. Loop has 2 letters. [2024-10-13 17:07:36,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:36,672 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:36,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:36,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 17:07:36,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:36,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:36,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:36,817 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2024-10-13 17:07:36,817 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:36,894 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 53 transitions. cyclomatic complexity: 16. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 76 transitions. Complement of second has 14 states. [2024-10-13 17:07:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:07:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2024-10-13 17:07:36,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 36 letters. Loop has 2 letters. [2024-10-13 17:07:36,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:36,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 38 letters. Loop has 2 letters. [2024-10-13 17:07:36,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:36,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 36 letters. Loop has 4 letters. [2024-10-13 17:07:36,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:36,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2024-10-13 17:07:36,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:36,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 55 states and 69 transitions. [2024-10-13 17:07:36,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:36,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:07:36,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 69 transitions. [2024-10-13 17:07:36,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:36,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-10-13 17:07:36,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 69 transitions. [2024-10-13 17:07:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-10-13 17:07:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 47 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-10-13 17:07:36,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-13 17:07:36,903 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-10-13 17:07:36,903 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 17:07:36,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 59 transitions. [2024-10-13 17:07:36,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:36,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:36,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:36,904 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:36,904 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:36,905 INFO L745 eck$LassoCheckResult]: Stem: 2728#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 2721#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 2729#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 2722#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2723#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2724#L521 assume !(main_~val~0#1 < 0); 2716#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2717#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2725#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2726#L521 assume !(main_~val~0#1 < 0); 2742#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2718#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2719#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2738#L521 assume !(main_~val~0#1 < 0); 2737#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2736#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2735#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 2732#L521 assume !(main_~val~0#1 < 0); 2734#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2733#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2731#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 2730#L519-4 main_~j~0#1 := 0; 2714#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2713#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2727#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2708#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2709#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2715#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2754#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2753#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2752#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2750#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2749#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2748#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2747#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2746#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2743#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 2741#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2739#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 2711#L527-3 [2024-10-13 17:07:36,905 INFO L747 eck$LassoCheckResult]: Loop: 2711#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2710#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 2711#L527-3 [2024-10-13 17:07:36,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash 296817483, now seen corresponding path program 8 times [2024-10-13 17:07:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:36,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159201108] [2024-10-13 17:07:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159201108] [2024-10-13 17:07:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159201108] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:07:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541108785] [2024-10-13 17:07:37,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:07:37,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:07:37,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:37,081 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:07:37,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2024-10-13 17:07:37,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:07:37,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:07:37,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 17:07:37,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:37,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:07:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541108785] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:07:37,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:07:37,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2024-10-13 17:07:37,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701891636] [2024-10-13 17:07:37,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:07:37,394 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:37,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 8 times [2024-10-13 17:07:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686993800] [2024-10-13 17:07:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:37,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:37,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:37,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-10-13 17:07:37,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:37,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 17:07:37,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-13 17:07:37,430 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. cyclomatic complexity: 18 Second operand has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:37,519 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-10-13 17:07:37,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 94 transitions. [2024-10-13 17:07:37,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:37,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 55 states and 68 transitions. [2024-10-13 17:07:37,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:37,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:37,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 68 transitions. [2024-10-13 17:07:37,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:37,520 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-10-13 17:07:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 68 transitions. [2024-10-13 17:07:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-13 17:07:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 51 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-10-13 17:07:37,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-10-13 17:07:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 17:07:37,527 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-10-13 17:07:37,527 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-13 17:07:37,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 64 transitions. [2024-10-13 17:07:37,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:37,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:37,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:37,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:37,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:37,529 INFO L745 eck$LassoCheckResult]: Stem: 3109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3102#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 3110#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3103#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3104#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3105#L521 assume !(main_~val~0#1 < 0); 3141#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3140#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3106#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3107#L521 assume !(main_~val~0#1 < 0); 3098#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3099#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3100#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3139#L521 assume !(main_~val~0#1 < 0); 3138#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3137#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3136#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3135#L521 assume !(main_~val~0#1 < 0); 3134#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3132#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3130#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3113#L521 assume !(main_~val~0#1 < 0); 3119#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3114#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3112#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 3111#L519-4 main_~j~0#1 := 0; 3095#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3096#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3094#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3090#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3091#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3097#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3131#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3129#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3128#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3126#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3125#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3124#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3123#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3122#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3118#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3117#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3115#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3093#L527-3 [2024-10-13 17:07:37,529 INFO L747 eck$LassoCheckResult]: Loop: 3093#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3092#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3093#L527-3 [2024-10-13 17:07:37,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:37,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1662287172, now seen corresponding path program 9 times [2024-10-13 17:07:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:37,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681179852] [2024-10-13 17:07:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:37,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:37,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:37,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:37,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 9 times [2024-10-13 17:07:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815526610] [2024-10-13 17:07:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:37,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:37,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash -269860279, now seen corresponding path program 4 times [2024-10-13 17:07:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:37,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931361603] [2024-10-13 17:07:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:37,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:37,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:37,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:38,438 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:38,438 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:38,438 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:38,438 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:38,438 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:38,438 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:38,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:38,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:38,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration13_Lasso [2024-10-13 17:07:38,438 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:38,438 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:38,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:38,895 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:38,895 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:38,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:38,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:38,897 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:38,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-10-13 17:07:38,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:38,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:38,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:38,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:38,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:38,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:38,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:38,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:38,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:38,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:38,919 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:38,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-10-13 17:07:38,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:38,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:38,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:38,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:38,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:38,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:38,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:38,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:38,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:38,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:38,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:38,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:38,944 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:38,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-10-13 17:07:38,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:38,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:38,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:38,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:38,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:38,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:38,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:38,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:38,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:38,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-13 17:07:38,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:38,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:38,967 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:38,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-10-13 17:07:38,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:38,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:38,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:38,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:38,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:38,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:38,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:38,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:38,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:38,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:38,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:38,992 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:38,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-10-13 17:07:38,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:39,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:39,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:39,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-10-13 17:07:39,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,019 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-10-13 17:07:39,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:39,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:39,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:39,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:39,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:39,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,042 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-10-13 17:07:39,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:39,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:39,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:39,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:39,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:39,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,066 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-10-13 17:07:39,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:39,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:39,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:39,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:39,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:39,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,089 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-10-13 17:07:39,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:39,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:39,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:39,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:39,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:39,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,113 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-10-13 17:07:39,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:39,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:39,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:39,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-10-13 17:07:39,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,139 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-10-13 17:07:39,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:39,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:39,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:39,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-10-13 17:07:39,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,167 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-10-13 17:07:39,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:39,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:39,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:39,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:39,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,194 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-10-13 17:07:39,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:39,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:39,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:39,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:39,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:39,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:39,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:39,212 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:39,220 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-13 17:07:39,221 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:07:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:39,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:39,222 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:39,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-10-13 17:07:39,223 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:39,233 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:39,233 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:39,233 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 16 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-10-13 17:07:39,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-10-13 17:07:39,255 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-10-13 17:07:39,256 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:07:39,256 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:07:39,257 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:07:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:39,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 17:07:39,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:39,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:39,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:39,406 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-13 17:07:39,407 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:39,425 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 66 transitions. Complement of second has 4 states. [2024-10-13 17:07:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:07:39,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-13 17:07:39,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:39,426 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:39,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:39,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 17:07:39,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:39,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:39,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:39,578 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-13 17:07:39,578 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:39,595 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 66 transitions. Complement of second has 4 states. [2024-10-13 17:07:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:07:39,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-13 17:07:39,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:39,596 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:39,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:39,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 17:07:39,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:39,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:39,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:39,757 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2024-10-13 17:07:39,758 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:39,848 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 64 transitions. cyclomatic complexity: 19. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 89 transitions. Complement of second has 16 states. [2024-10-13 17:07:39,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:07:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2024-10-13 17:07:39,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 44 letters. Loop has 2 letters. [2024-10-13 17:07:39,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:39,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 46 letters. Loop has 2 letters. [2024-10-13 17:07:39,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:39,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 44 letters. Loop has 4 letters. [2024-10-13 17:07:39,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:39,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 89 transitions. [2024-10-13 17:07:39,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:39,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 65 states and 82 transitions. [2024-10-13 17:07:39,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:39,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:07:39,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 82 transitions. [2024-10-13 17:07:39,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:39,851 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 82 transitions. [2024-10-13 17:07:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 82 transitions. [2024-10-13 17:07:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2024-10-13 17:07:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-10-13 17:07:39,854 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-10-13 17:07:39,854 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-10-13 17:07:39,854 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-13 17:07:39,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 70 transitions. [2024-10-13 17:07:39,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:39,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:39,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:39,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:39,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:39,855 INFO L745 eck$LassoCheckResult]: Stem: 3858#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3851#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 3859#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 3852#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3853#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3854#L521 assume !(main_~val~0#1 < 0); 3846#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3847#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3855#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3856#L521 assume !(main_~val~0#1 < 0); 3876#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3848#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3849#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3872#L521 assume !(main_~val~0#1 < 0); 3871#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3870#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3869#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3868#L521 assume !(main_~val~0#1 < 0); 3867#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3866#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3865#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3862#L521 assume !(main_~val~0#1 < 0); 3864#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3863#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 3861#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 3860#L519-4 main_~j~0#1 := 0; 3843#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3844#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3892#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3891#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3845#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3842#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3857#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3837#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3838#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3889#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3888#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3887#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3886#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3884#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3883#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3882#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3881#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3880#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3877#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 3875#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3873#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 3840#L527-3 [2024-10-13 17:07:39,856 INFO L747 eck$LassoCheckResult]: Loop: 3840#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3839#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 3840#L527-3 [2024-10-13 17:07:39,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1637690471, now seen corresponding path program 10 times [2024-10-13 17:07:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342527650] [2024-10-13 17:07:39,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:39,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342527650] [2024-10-13 17:07:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342527650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:07:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462306797] [2024-10-13 17:07:40,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 17:07:40,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:07:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:40,112 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:07:40,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2024-10-13 17:07:40,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 17:07:40,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:07:40,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 17:07:40,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:40,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:07:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462306797] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:07:40,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:07:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2024-10-13 17:07:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390865739] [2024-10-13 17:07:40,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:07:40,437 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:40,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 10 times [2024-10-13 17:07:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:40,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588514631] [2024-10-13 17:07:40,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:40,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:40,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:40,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 17:07:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-10-13 17:07:40,479 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. cyclomatic complexity: 21 Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:40,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:40,632 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-10-13 17:07:40,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 111 transitions. [2024-10-13 17:07:40,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:40,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 64 states and 79 transitions. [2024-10-13 17:07:40,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:40,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:40,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 79 transitions. [2024-10-13 17:07:40,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:40,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-10-13 17:07:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 79 transitions. [2024-10-13 17:07:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-13 17:07:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-10-13 17:07:40,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-10-13 17:07:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 17:07:40,643 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-10-13 17:07:40,643 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-10-13 17:07:40,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2024-10-13 17:07:40,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:40,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:40,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:40,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:40,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:40,645 INFO L745 eck$LassoCheckResult]: Stem: 4312#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 4306#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 4313#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 4307#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4308#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4309#L521 assume !(main_~val~0#1 < 0); 4302#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4303#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4304#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4310#L521 assume !(main_~val~0#1 < 0); 4353#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4352#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4351#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4350#L521 assume !(main_~val~0#1 < 0); 4349#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4348#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4347#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4346#L521 assume !(main_~val~0#1 < 0); 4345#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4344#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4343#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4342#L521 assume !(main_~val~0#1 < 0); 4341#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4340#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4339#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4316#L521 assume !(main_~val~0#1 < 0); 4322#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 4317#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 4315#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 4314#L519-4 main_~j~0#1 := 0; 4299#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4300#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4337#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4336#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4301#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4298#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4311#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4293#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4294#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4334#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4333#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4332#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4331#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4329#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4328#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4327#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4326#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4325#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4321#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 4320#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 4318#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 4296#L527-3 [2024-10-13 17:07:40,645 INFO L747 eck$LassoCheckResult]: Loop: 4296#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 4295#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 4296#L527-3 [2024-10-13 17:07:40,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 618476690, now seen corresponding path program 11 times [2024-10-13 17:07:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:40,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478796840] [2024-10-13 17:07:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:40,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:40,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:40,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 11 times [2024-10-13 17:07:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:40,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919585296] [2024-10-13 17:07:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:40,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:40,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:40,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:40,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1650613783, now seen corresponding path program 5 times [2024-10-13 17:07:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:40,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119800717] [2024-10-13 17:07:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:40,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:40,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:42,040 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:42,040 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:42,040 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:42,040 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:42,040 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:42,040 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,040 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:42,040 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:42,040 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration15_Lasso [2024-10-13 17:07:42,040 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:42,040 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:42,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:42,722 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:42,722 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,724 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-10-13 17:07:42,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-10-13 17:07:42,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,752 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-10-13 17:07:42,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:42,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,776 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-10-13 17:07:42,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,789 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,804 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-10-13 17:07:42,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:42,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,829 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-10-13 17:07:42,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:42,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:42,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:42,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,854 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-10-13 17:07:42,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:42,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,877 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-10-13 17:07:42,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:42,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,901 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-10-13 17:07:42,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,925 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-10-13 17:07:42,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-10-13 17:07:42,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,948 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-10-13 17:07:42,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:42,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:42,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-10-13 17:07:42,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,973 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-10-13 17:07:42,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:42,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:42,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:42,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:42,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:42,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:42,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:42,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:42,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:42,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:42,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:42,996 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:42,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-10-13 17:07:42,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:43,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:43,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:43,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:43,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,019 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-10-13 17:07:43,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:43,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:43,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:43,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:43,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,045 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-10-13 17:07:43,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-10-13 17:07:43,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,071 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-10-13 17:07:43,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-10-13 17:07:43,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,099 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-10-13 17:07:43,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,126 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-10-13 17:07:43,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-10-13 17:07:43,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,153 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-10-13 17:07:43,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-10-13 17:07:43,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,180 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-10-13 17:07:43,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-10-13 17:07:43,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,208 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-10-13 17:07:43,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,225 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-10-13 17:07:43,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,236 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-10-13 17:07:43,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:43,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-10-13 17:07:43,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,263 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-10-13 17:07:43,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:43,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:43,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:43,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:43,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:43,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:43,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:43,281 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:43,285 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-13 17:07:43,285 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-13 17:07:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:43,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:43,287 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:43,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-10-13 17:07:43,288 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:43,298 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:43,298 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:43,298 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 20)_1 Supporting invariants [] [2024-10-13 17:07:43,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-10-13 17:07:43,348 INFO L156 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2024-10-13 17:07:43,350 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:07:43,350 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:07:43,350 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:07:43,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:43,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 17:07:43,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:43,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:43,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:43,644 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:07:43,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:43,680 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 77 transitions. Complement of second has 5 states. [2024-10-13 17:07:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:07:43,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 52 letters. Loop has 2 letters. [2024-10-13 17:07:43,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:43,681 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:43,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:43,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 17:07:43,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:43,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:43,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:43,971 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:07:43,971 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:44,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-10-13 17:07:44,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 77 transitions. Complement of second has 5 states. [2024-10-13 17:07:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:07:44,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 52 letters. Loop has 2 letters. [2024-10-13 17:07:44,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:44,027 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:44,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:44,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 17:07:44,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:44,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:44,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:44,325 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:07:44,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22 Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:44,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 75 transitions. cyclomatic complexity: 22. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 102 transitions. Complement of second has 19 states. [2024-10-13 17:07:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:07:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2024-10-13 17:07:44,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 52 letters. Loop has 2 letters. [2024-10-13 17:07:44,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:44,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 54 letters. Loop has 2 letters. [2024-10-13 17:07:44,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:44,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 52 letters. Loop has 4 letters. [2024-10-13 17:07:44,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:44,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2024-10-13 17:07:44,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:44,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 75 states and 95 transitions. [2024-10-13 17:07:44,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:44,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:07:44,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 95 transitions. [2024-10-13 17:07:44,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:44,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 95 transitions. [2024-10-13 17:07:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 95 transitions. [2024-10-13 17:07:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2024-10-13 17:07:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 65 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-10-13 17:07:44,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-10-13 17:07:44,466 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-10-13 17:07:44,466 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-10-13 17:07:44,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 81 transitions. [2024-10-13 17:07:44,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:44,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:44,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:44,467 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:44,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:44,467 INFO L745 eck$LassoCheckResult]: Stem: 5252#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5245#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 5253#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5246#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5247#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5248#L521 assume !(main_~val~0#1 < 0); 5240#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5241#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5249#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5250#L521 assume !(main_~val~0#1 < 0); 5274#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5242#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5243#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5270#L521 assume !(main_~val~0#1 < 0); 5269#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5268#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5267#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5266#L521 assume !(main_~val~0#1 < 0); 5265#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5264#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5263#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5262#L521 assume !(main_~val~0#1 < 0); 5261#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5260#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5259#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5256#L521 assume !(main_~val~0#1 < 0); 5258#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5257#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5255#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 5254#L519-4 main_~j~0#1 := 0; 5237#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5238#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5295#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5294#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5239#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5236#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5251#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5231#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5232#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5292#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5291#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5290#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5289#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5287#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5286#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5285#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5284#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5282#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5281#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5280#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5279#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5278#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5275#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5273#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5271#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5234#L527-3 [2024-10-13 17:07:44,467 INFO L747 eck$LassoCheckResult]: Loop: 5234#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5233#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5234#L527-3 [2024-10-13 17:07:44,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:44,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1396913127, now seen corresponding path program 12 times [2024-10-13 17:07:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:44,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706122293] [2024-10-13 17:07:44,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:44,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:44,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:44,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706122293] [2024-10-13 17:07:44,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706122293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:07:44,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068380186] [2024-10-13 17:07:44,714 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 17:07:44,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:07:44,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:44,716 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:07:44,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2024-10-13 17:07:44,819 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-13 17:07:44,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:07:44,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:07:44,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:45,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:07:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068380186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:07:45,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:07:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2024-10-13 17:07:45,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573703262] [2024-10-13 17:07:45,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:07:45,233 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:45,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 12 times [2024-10-13 17:07:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:45,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317034446] [2024-10-13 17:07:45,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:45,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:45,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:45,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 17:07:45,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2024-10-13 17:07:45,264 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. cyclomatic complexity: 24 Second operand has 26 states, 25 states have (on average 3.68) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:45,405 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2024-10-13 17:07:45,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 128 transitions. [2024-10-13 17:07:45,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:45,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 73 states and 90 transitions. [2024-10-13 17:07:45,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:45,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:45,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 90 transitions. [2024-10-13 17:07:45,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:45,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-10-13 17:07:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 90 transitions. [2024-10-13 17:07:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-10-13 17:07:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2024-10-13 17:07:45,418 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-10-13 17:07:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 17:07:45,419 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-10-13 17:07:45,419 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-10-13 17:07:45,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 86 transitions. [2024-10-13 17:07:45,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:45,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:45,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:45,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:45,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:45,421 INFO L745 eck$LassoCheckResult]: Stem: 5780#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5773#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 5774#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 5781#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 5775#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 5776#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5777#L521 assume !(main_~val~0#1 < 0); 5770#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5771#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5772#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5778#L521 assume !(main_~val~0#1 < 0); 5830#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5829#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5828#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5827#L521 assume !(main_~val~0#1 < 0); 5826#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5825#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5824#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5823#L521 assume !(main_~val~0#1 < 0); 5822#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5821#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5820#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5819#L521 assume !(main_~val~0#1 < 0); 5818#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5817#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5816#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5815#L521 assume !(main_~val~0#1 < 0); 5814#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5813#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5812#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5784#L521 assume !(main_~val~0#1 < 0); 5790#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 5785#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 5783#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 5782#L519-4 main_~j~0#1 := 0; 5767#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5768#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5810#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5809#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5769#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5766#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5779#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5761#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5762#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5807#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5806#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5805#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5804#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5802#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5801#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5800#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5799#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5797#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5796#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5795#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5794#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5793#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5789#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 5788#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 5786#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 5764#L527-3 [2024-10-13 17:07:45,421 INFO L747 eck$LassoCheckResult]: Loop: 5764#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 5763#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 5764#L527-3 [2024-10-13 17:07:45,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:45,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1611822112, now seen corresponding path program 13 times [2024-10-13 17:07:45,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:45,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559562015] [2024-10-13 17:07:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:45,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:45,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:45,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:45,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 13 times [2024-10-13 17:07:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:45,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681158689] [2024-10-13 17:07:45,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:45,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:45,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:45,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:45,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1522145765, now seen corresponding path program 6 times [2024-10-13 17:07:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535519624] [2024-10-13 17:07:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:45,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:45,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:48,713 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:48,713 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:48,713 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:48,713 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:48,713 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:48,713 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:48,713 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:48,714 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:48,714 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration17_Lasso [2024-10-13 17:07:48,714 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:48,714 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:48,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:48,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:49,920 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:49,920 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:49,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:49,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:49,921 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:49,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-10-13 17:07:49,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:49,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:49,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:49,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:49,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:49,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:49,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:49,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:49,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:49,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:49,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:49,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:49,945 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:49,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-10-13 17:07:49,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:49,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:49,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:49,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:49,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:49,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:49,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:49,962 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:49,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-10-13 17:07:49,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:49,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:49,973 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:49,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-10-13 17:07:49,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:49,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:49,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:49,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:49,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:49,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:49,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:49,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:50,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-10-13 17:07:50,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:50,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:50,005 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:50,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-10-13 17:07:50,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:50,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:50,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:50,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:50,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:50,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:50,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:50,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:50,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-10-13 17:07:50,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:50,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:50,033 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:50,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-10-13 17:07:50,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:50,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:50,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:50,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:50,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:50,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:50,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:50,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:50,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-10-13 17:07:50,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:50,062 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:50,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-10-13 17:07:50,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:50,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:50,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:50,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:50,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:50,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:50,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:50,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:50,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-10-13 17:07:50,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:50,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:50,087 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:50,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-10-13 17:07:50,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:50,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:50,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:50,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:50,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:50,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:50,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:50,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:50,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:50,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:50,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:50,113 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:50,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-10-13 17:07:50,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:50,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:50,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:50,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:50,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:50,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:50,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:50,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:50,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-10-13 17:07:50,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:50,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:50,140 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:50,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-10-13 17:07:50,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:50,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:50,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:50,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:50,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:50,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:50,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:50,158 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:50,164 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-13 17:07:50,164 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-13 17:07:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:50,166 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:50,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-10-13 17:07:50,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:50,177 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:50,177 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:50,177 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ ULTIMATE.start_main_~arr~0#1.offset 24))_1 Supporting invariants [] [2024-10-13 17:07:50,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:50,227 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2024-10-13 17:07:50,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:07:50,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:07:50,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:07:50,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:50,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:50,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:07:50,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:50,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:50,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:50,525 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:07:50,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:50,544 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 88 transitions. Complement of second has 4 states. [2024-10-13 17:07:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:07:50,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 60 letters. Loop has 2 letters. [2024-10-13 17:07:50,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:50,545 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:50,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:07:50,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:50,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:50,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:50,750 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:07:50,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:50,767 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 88 transitions. Complement of second has 4 states. [2024-10-13 17:07:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:07:50,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 60 letters. Loop has 2 letters. [2024-10-13 17:07:50,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:50,768 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:50,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:50,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:07:50,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:50,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:50,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:50,965 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 2 loop predicates [2024-10-13 17:07:50,965 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:51,090 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 86 transitions. cyclomatic complexity: 25. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 90 states and 115 transitions. Complement of second has 20 states. [2024-10-13 17:07:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:07:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2024-10-13 17:07:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 60 letters. Loop has 2 letters. [2024-10-13 17:07:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 62 letters. Loop has 2 letters. [2024-10-13 17:07:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 60 letters. Loop has 4 letters. [2024-10-13 17:07:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:51,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 115 transitions. [2024-10-13 17:07:51,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:51,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 85 states and 108 transitions. [2024-10-13 17:07:51,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:51,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:07:51,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 108 transitions. [2024-10-13 17:07:51,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:51,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-10-13 17:07:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 108 transitions. [2024-10-13 17:07:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-10-13 17:07:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 74 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2024-10-13 17:07:51,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-10-13 17:07:51,096 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-10-13 17:07:51,096 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-10-13 17:07:51,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 92 transitions. [2024-10-13 17:07:51,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:51,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:51,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:51,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:51,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:51,098 INFO L745 eck$LassoCheckResult]: Stem: 6791#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6783#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 6784#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 6792#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 6785#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6786#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6787#L521 assume !(main_~val~0#1 < 0); 6779#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6780#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6788#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6789#L521 assume !(main_~val~0#1 < 0); 6817#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6781#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6782#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6813#L521 assume !(main_~val~0#1 < 0); 6812#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6811#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6810#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6809#L521 assume !(main_~val~0#1 < 0); 6808#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6807#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6806#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6805#L521 assume !(main_~val~0#1 < 0); 6804#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6803#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6802#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6801#L521 assume !(main_~val~0#1 < 0); 6800#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6799#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6798#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 6795#L521 assume !(main_~val~0#1 < 0); 6797#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 6796#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 6794#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 6793#L519-4 main_~j~0#1 := 0; 6776#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6777#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6843#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6842#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6778#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6775#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6790#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6770#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6771#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6840#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6839#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6838#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6837#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6835#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6834#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6833#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6832#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6830#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6829#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6828#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6827#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6825#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6824#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6823#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6822#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6821#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6818#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 6816#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 6814#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 6773#L527-3 [2024-10-13 17:07:51,098 INFO L747 eck$LassoCheckResult]: Loop: 6773#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 6772#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 6773#L527-3 [2024-10-13 17:07:51,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1801767883, now seen corresponding path program 14 times [2024-10-13 17:07:51,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:51,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575215809] [2024-10-13 17:07:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:51,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 66 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575215809] [2024-10-13 17:07:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575215809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:07:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271670137] [2024-10-13 17:07:51,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:07:51,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:07:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:51,432 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:07:51,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2024-10-13 17:07:51,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:07:51,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:07:51,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 17:07:51,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:51,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:07:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:51,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271670137] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:07:51,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:07:51,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2024-10-13 17:07:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543152897] [2024-10-13 17:07:51,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:07:51,910 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:51,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 14 times [2024-10-13 17:07:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:51,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110889592] [2024-10-13 17:07:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:51,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:51,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:51,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 17:07:51,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2024-10-13 17:07:51,949 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 29 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:52,071 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2024-10-13 17:07:52,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 145 transitions. [2024-10-13 17:07:52,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:52,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 82 states and 101 transitions. [2024-10-13 17:07:52,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:52,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:52,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 101 transitions. [2024-10-13 17:07:52,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:52,073 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-10-13 17:07:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 101 transitions. [2024-10-13 17:07:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-13 17:07:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 78 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2024-10-13 17:07:52,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-10-13 17:07:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 17:07:52,079 INFO L425 stractBuchiCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-10-13 17:07:52,079 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-10-13 17:07:52,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 97 transitions. [2024-10-13 17:07:52,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:52,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:52,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:52,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:52,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:52,081 INFO L745 eck$LassoCheckResult]: Stem: 7393#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 7387#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 7394#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 7388#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 7389#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7390#L521 assume !(main_~val~0#1 < 0); 7383#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7384#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7385#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7391#L521 assume !(main_~val~0#1 < 0); 7452#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7451#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7450#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7449#L521 assume !(main_~val~0#1 < 0); 7448#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7447#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7446#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7445#L521 assume !(main_~val~0#1 < 0); 7444#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7443#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7442#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7441#L521 assume !(main_~val~0#1 < 0); 7440#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7439#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7438#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7437#L521 assume !(main_~val~0#1 < 0); 7436#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7435#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7434#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7433#L521 assume !(main_~val~0#1 < 0); 7432#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7431#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7430#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7397#L521 assume !(main_~val~0#1 < 0); 7403#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 7398#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 7396#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 7395#L519-4 main_~j~0#1 := 0; 7380#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7381#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7428#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7427#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7382#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7379#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7392#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7374#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7375#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7425#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7424#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7423#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7422#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7420#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7419#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7418#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7417#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7415#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7414#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7413#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7412#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7410#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7409#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7408#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7407#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7406#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7402#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 7401#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7399#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 7377#L527-3 [2024-10-13 17:07:52,081 INFO L747 eck$LassoCheckResult]: Loop: 7377#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 7376#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 7377#L527-3 [2024-10-13 17:07:52,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash 260997934, now seen corresponding path program 15 times [2024-10-13 17:07:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:52,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713759008] [2024-10-13 17:07:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:52,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:52,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:52,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 15 times [2024-10-13 17:07:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047807659] [2024-10-13 17:07:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:52,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:52,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:52,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1710912947, now seen corresponding path program 7 times [2024-10-13 17:07:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320851230] [2024-10-13 17:07:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:52,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:52,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:55,435 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:07:55,435 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:07:55,436 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:07:55,436 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:07:55,436 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:07:55,436 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:55,436 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:07:55,436 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:07:55,436 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration19_Lasso [2024-10-13 17:07:55,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:07:55,436 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:07:55,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:07:55,890 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:07:55,891 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:07:55,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:55,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:55,892 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:55,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-10-13 17:07:55,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:55,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:55,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:55,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:55,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:55,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:55,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:55,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:55,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:55,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-10-13 17:07:55,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:55,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:55,917 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:55,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-10-13 17:07:55,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:55,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:55,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:55,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:55,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:55,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:55,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:55,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:55,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:55,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-10-13 17:07:55,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:55,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:55,941 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:55,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-10-13 17:07:55,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:55,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:55,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:55,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:55,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:55,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:55,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:55,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:55,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-10-13 17:07:55,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:55,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:55,967 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:55,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-10-13 17:07:55,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:55,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:55,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:55,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:55,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:55,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:55,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:55,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:55,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:55,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-10-13 17:07:55,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:55,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:55,990 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:55,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-10-13 17:07:55,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:56,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:56,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:56,003 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-10-13 17:07:56,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,014 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-10-13 17:07:56,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:56,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:56,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:56,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:56,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,037 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-10-13 17:07:56,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:56,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:56,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:56,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:56,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,061 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-10-13 17:07:56,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-10-13 17:07:56,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,086 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-10-13 17:07:56,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:56,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:56,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:56,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-10-13 17:07:56,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,110 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-10-13 17:07:56,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:56,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:56,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:56,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-10-13 17:07:56,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,135 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-10-13 17:07:56,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:56,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:56,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:56,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2024-10-13 17:07:56,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,158 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-10-13 17:07:56,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:56,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:56,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:56,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-10-13 17:07:56,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,181 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-10-13 17:07:56,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:07:56,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:07:56,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:07:56,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-10-13 17:07:56,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,206 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-10-13 17:07:56,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-10-13 17:07:56,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,231 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-10-13 17:07:56,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:56,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,267 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-10-13 17:07:56,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:56,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,293 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-10-13 17:07:56,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-10-13 17:07:56,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,320 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-10-13 17:07:56,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:56,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,347 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-10-13 17:07:56,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-10-13 17:07:56,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,374 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-10-13 17:07:56,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:56,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,400 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-10-13 17:07:56,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:56,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,450 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-10-13 17:07:56,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,477 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-10-13 17:07:56,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-10-13 17:07:56,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,503 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-10-13 17:07:56,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,517 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-10-13 17:07:56,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,528 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-10-13 17:07:56,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:07:56,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-10-13 17:07:56,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,554 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-10-13 17:07:56,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:07:56,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:07:56,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:07:56,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:07:56,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:07:56,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:07:56,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:07:56,571 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:07:56,580 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-10-13 17:07:56,580 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:07:56,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:07:56,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:56,583 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:07:56,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-10-13 17:07:56,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:07:56,595 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:07:56,596 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:07:56,596 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 28)_1 Supporting invariants [] [2024-10-13 17:07:56,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-10-13 17:07:56,621 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-10-13 17:07:56,622 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:07:56,622 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:07:56,622 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:07:56,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:56,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 17:07:56,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:56,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:56,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:56,980 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-13 17:07:56,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:57,019 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 99 transitions. Complement of second has 5 states. [2024-10-13 17:07:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:07:57,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 68 letters. Loop has 2 letters. [2024-10-13 17:07:57,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:57,021 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:57,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:57,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 17:07:57,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:57,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:57,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:57,401 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-13 17:07:57,402 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:57,440 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 80 states and 99 transitions. Complement of second has 5 states. [2024-10-13 17:07:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:07:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:07:57,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 68 letters. Loop has 2 letters. [2024-10-13 17:07:57,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:57,442 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:07:57,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:57,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 17:07:57,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:57,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2024-10-13 17:07:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:57,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:07:57,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:57,878 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-13 17:07:57,878 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:58,048 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 97 transitions. cyclomatic complexity: 28. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 100 states and 128 transitions. Complement of second has 23 states. [2024-10-13 17:07:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:07:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2024-10-13 17:07:58,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 68 letters. Loop has 2 letters. [2024-10-13 17:07:58,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:58,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 70 letters. Loop has 2 letters. [2024-10-13 17:07:58,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:58,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 69 transitions. Stem has 68 letters. Loop has 4 letters. [2024-10-13 17:07:58,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:07:58,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 128 transitions. [2024-10-13 17:07:58,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:58,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 95 states and 121 transitions. [2024-10-13 17:07:58,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:07:58,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:07:58,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 121 transitions. [2024-10-13 17:07:58,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:58,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 121 transitions. [2024-10-13 17:07:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 121 transitions. [2024-10-13 17:07:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2024-10-13 17:07:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 83 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2024-10-13 17:07:58,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-10-13 17:07:58,055 INFO L425 stractBuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2024-10-13 17:07:58,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-10-13 17:07:58,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 103 transitions. [2024-10-13 17:07:58,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:58,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:58,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:58,056 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:58,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:58,056 INFO L745 eck$LassoCheckResult]: Stem: 8511#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 8504#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 8512#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 8505#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 8506#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8507#L521 assume !(main_~val~0#1 < 0); 8499#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8500#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8508#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8509#L521 assume !(main_~val~0#1 < 0); 8541#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8501#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8502#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8537#L521 assume !(main_~val~0#1 < 0); 8536#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8535#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8534#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8533#L521 assume !(main_~val~0#1 < 0); 8532#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8531#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8530#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8529#L521 assume !(main_~val~0#1 < 0); 8528#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8527#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8526#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8525#L521 assume !(main_~val~0#1 < 0); 8524#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8523#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8522#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8521#L521 assume !(main_~val~0#1 < 0); 8520#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8519#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8518#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8515#L521 assume !(main_~val~0#1 < 0); 8517#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 8516#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 8514#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 8513#L519-4 main_~j~0#1 := 0; 8496#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8497#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8572#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8571#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8498#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8495#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8510#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8490#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8491#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8569#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8568#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8567#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8566#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8564#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8563#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8562#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8561#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8559#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8558#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8557#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8556#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8554#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8553#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8552#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8551#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8549#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8548#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8547#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8546#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8545#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8542#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 8540#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 8538#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 8493#L527-3 [2024-10-13 17:07:58,057 INFO L747 eck$LassoCheckResult]: Loop: 8493#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 8492#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 8493#L527-3 [2024-10-13 17:07:58,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash -785132413, now seen corresponding path program 16 times [2024-10-13 17:07:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082612644] [2024-10-13 17:07:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:07:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 91 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:07:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082612644] [2024-10-13 17:07:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082612644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:07:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356827084] [2024-10-13 17:07:58,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 17:07:58,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:07:58,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:07:58,381 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:07:58,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2024-10-13 17:07:58,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 17:07:58,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:07:58,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 17:07:58,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:07:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:58,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:07:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:07:58,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356827084] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:07:58,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:07:58,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2024-10-13 17:07:58,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230011803] [2024-10-13 17:07:58,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:07:58,918 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:07:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 16 times [2024-10-13 17:07:58,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:58,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014992315] [2024-10-13 17:07:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:58,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:58,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:07:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 17:07:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2024-10-13 17:07:58,963 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. cyclomatic complexity: 30 Second operand has 32 states, 31 states have (on average 3.7419354838709675) internal successors, (116), 32 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:07:59,155 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-10-13 17:07:59,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 162 transitions. [2024-10-13 17:07:59,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:59,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 91 states and 112 transitions. [2024-10-13 17:07:59,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:07:59,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:07:59,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 112 transitions. [2024-10-13 17:07:59,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:07:59,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 112 transitions. [2024-10-13 17:07:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 112 transitions. [2024-10-13 17:07:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-10-13 17:07:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 87 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:07:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-10-13 17:07:59,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-10-13 17:07:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 17:07:59,160 INFO L425 stractBuchiCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-10-13 17:07:59,161 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-10-13 17:07:59,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 108 transitions. [2024-10-13 17:07:59,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:07:59,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:07:59,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:07:59,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:07:59,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:07:59,163 INFO L745 eck$LassoCheckResult]: Stem: 9187#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 9181#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 9188#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 9182#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 9183#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9184#L521 assume !(main_~val~0#1 < 0); 9177#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9178#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9179#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9185#L521 assume !(main_~val~0#1 < 0); 9255#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9254#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9253#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9252#L521 assume !(main_~val~0#1 < 0); 9251#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9250#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9249#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9248#L521 assume !(main_~val~0#1 < 0); 9247#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9246#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9245#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9244#L521 assume !(main_~val~0#1 < 0); 9243#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9242#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9241#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9240#L521 assume !(main_~val~0#1 < 0); 9239#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9238#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9237#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9236#L521 assume !(main_~val~0#1 < 0); 9235#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9234#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9233#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9232#L521 assume !(main_~val~0#1 < 0); 9231#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9230#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9229#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9191#L521 assume !(main_~val~0#1 < 0); 9197#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 9192#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 9190#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 9189#L519-4 main_~j~0#1 := 0; 9174#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9175#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9227#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9226#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9176#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9173#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9186#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9168#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9169#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9224#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9223#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9222#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9221#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9219#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9218#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9217#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9216#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9214#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9213#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9212#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9211#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9209#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9208#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9207#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9206#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9204#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9203#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9202#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9201#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9200#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9196#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 9195#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 9193#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 9171#L527-3 [2024-10-13 17:07:59,164 INFO L747 eck$LassoCheckResult]: Loop: 9171#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 9170#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 9171#L527-3 [2024-10-13 17:07:59,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1182197124, now seen corresponding path program 17 times [2024-10-13 17:07:59,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955381289] [2024-10-13 17:07:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:59,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:59,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:59,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 17 times [2024-10-13 17:07:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:59,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289295521] [2024-10-13 17:07:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:59,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:59,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:07:59,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:07:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2074898817, now seen corresponding path program 8 times [2024-10-13 17:07:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:07:59,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987491107] [2024-10-13 17:07:59,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:07:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:07:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:59,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:07:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:07:59,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:04,465 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 301 DAG size of output: 221 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-13 17:08:05,132 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:08:05,132 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:08:05,132 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:08:05,132 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:08:05,132 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:08:05,132 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:05,132 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:08:05,132 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:08:05,132 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration21_Lasso [2024-10-13 17:08:05,132 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:08:05,132 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:08:05,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:05,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:05,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:05,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:05,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:05,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:06,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:07,227 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:08:07,227 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:08:07,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,228 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-10-13 17:08:07,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:07,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:07,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:07,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-10-13 17:08:07,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,251 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-10-13 17:08:07,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:07,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:07,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:07,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-10-13 17:08:07,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,275 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-10-13 17:08:07,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:07,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:07,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-10-13 17:08:07,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,300 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-10-13 17:08:07,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:07,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:07,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:07,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-10-13 17:08:07,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,324 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-10-13 17:08:07,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:07,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:07,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:07,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:07,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,348 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-10-13 17:08:07,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:07,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:07,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:07,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,373 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-10-13 17:08:07,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:07,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:07,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-10-13 17:08:07,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,399 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-10-13 17:08:07,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:07,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:07,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-10-13 17:08:07,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,427 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-10-13 17:08:07,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:07,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:07,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-10-13 17:08:07,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,455 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-10-13 17:08:07,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:07,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:07,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-10-13 17:08:07,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,485 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-10-13 17:08:07,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:07,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:07,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:07,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-10-13 17:08:07,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,514 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-10-13 17:08:07,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:07,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:07,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:07,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:07,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:07,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:07,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:07,533 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:08:07,551 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-13 17:08:07,551 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:08:07,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:07,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:07,553 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:07,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-10-13 17:08:07,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:08:07,569 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:08:07,570 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:08:07,570 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) (+ 32 ULTIMATE.start_main_~arr~0#1.offset))_1 Supporting invariants [] [2024-10-13 17:08:07,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2024-10-13 17:08:07,683 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2024-10-13 17:08:07,685 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:08:07,686 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:08:07,686 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:08:07,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:07,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 17:08:07,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:07,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:07,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:07,975 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-13 17:08:07,976 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:07,996 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 110 transitions. Complement of second has 4 states. [2024-10-13 17:08:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:08:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:08:07,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 76 letters. Loop has 2 letters. [2024-10-13 17:08:07,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:07,996 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:08:08,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:08,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 17:08:08,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:08,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:08,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:08,265 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-13 17:08:08,265 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:08,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 110 transitions. Complement of second has 4 states. [2024-10-13 17:08:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:08:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-10-13 17:08:08,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 76 letters. Loop has 2 letters. [2024-10-13 17:08:08,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:08,291 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:08:08,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:08,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 17:08:08,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:08,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:08,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:08,565 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2024-10-13 17:08:08,565 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31 Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:08,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 108 transitions. cyclomatic complexity: 31. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 110 states and 141 transitions. Complement of second has 24 states. [2024-10-13 17:08:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:08:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2024-10-13 17:08:08,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 76 letters. Loop has 2 letters. [2024-10-13 17:08:08,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:08,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 78 letters. Loop has 2 letters. [2024-10-13 17:08:08,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:08,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 75 transitions. Stem has 76 letters. Loop has 4 letters. [2024-10-13 17:08:08,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:08,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 141 transitions. [2024-10-13 17:08:08,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:08,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 105 states and 134 transitions. [2024-10-13 17:08:08,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:08:08,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:08:08,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 134 transitions. [2024-10-13 17:08:08,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:08:08,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 134 transitions. [2024-10-13 17:08:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 134 transitions. [2024-10-13 17:08:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-10-13 17:08:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 92 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2024-10-13 17:08:08,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-10-13 17:08:08,757 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-10-13 17:08:08,757 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-10-13 17:08:08,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 114 transitions. [2024-10-13 17:08:08,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:08,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:08:08,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:08:08,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:08:08,758 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:08:08,758 INFO L745 eck$LassoCheckResult]: Stem: 10444#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 10437#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 10445#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 10438#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 10439#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10440#L521 assume !(main_~val~0#1 < 0); 10432#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10433#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10441#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10442#L521 assume !(main_~val~0#1 < 0); 10478#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10434#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10435#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10474#L521 assume !(main_~val~0#1 < 0); 10473#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10472#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10471#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10470#L521 assume !(main_~val~0#1 < 0); 10469#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10468#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10467#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10466#L521 assume !(main_~val~0#1 < 0); 10465#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10464#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10463#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10462#L521 assume !(main_~val~0#1 < 0); 10461#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10460#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10459#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10458#L521 assume !(main_~val~0#1 < 0); 10457#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10456#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10455#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10454#L521 assume !(main_~val~0#1 < 0); 10453#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10452#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10451#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 10448#L521 assume !(main_~val~0#1 < 0); 10450#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 10449#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 10447#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 10446#L519-4 main_~j~0#1 := 0; 10429#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10430#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10514#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10513#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10431#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10428#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10443#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10423#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10424#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10511#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10510#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10509#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10508#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10506#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10505#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10504#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10503#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10501#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10500#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10499#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10498#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10496#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10495#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10494#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10493#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10491#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10490#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10489#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10488#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10486#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10485#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10484#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10483#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10482#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10479#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 10477#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 10475#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 10426#L527-3 [2024-10-13 17:08:08,758 INFO L747 eck$LassoCheckResult]: Loop: 10426#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 10425#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 10426#L527-3 [2024-10-13 17:08:08,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1112937681, now seen corresponding path program 18 times [2024-10-13 17:08:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:08,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995342869] [2024-10-13 17:08:08,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:08,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:08,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-10-13 17:08:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:08:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995342869] [2024-10-13 17:08:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995342869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:08:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877639544] [2024-10-13 17:08:09,193 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 17:08:09,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:08:09,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:09,195 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:08:09,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2024-10-13 17:08:09,352 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-10-13 17:08:09,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:08:09,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 17:08:09,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:09,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:08:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877639544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:08:09,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:08:09,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2024-10-13 17:08:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413012917] [2024-10-13 17:08:09,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:08:09,856 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:08:09,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 18 times [2024-10-13 17:08:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304583091] [2024-10-13 17:08:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:09,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:09,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:08:09,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 17:08:09,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 17:08:09,897 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. cyclomatic complexity: 33 Second operand has 35 states, 34 states have (on average 3.764705882352941) internal successors, (128), 35 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:08:10,116 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2024-10-13 17:08:10,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 179 transitions. [2024-10-13 17:08:10,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:10,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 100 states and 123 transitions. [2024-10-13 17:08:10,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:08:10,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:08:10,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 123 transitions. [2024-10-13 17:08:10,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:08:10,118 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-10-13 17:08:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 123 transitions. [2024-10-13 17:08:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-10-13 17:08:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 96 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2024-10-13 17:08:10,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-10-13 17:08:10,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 17:08:10,121 INFO L425 stractBuchiCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-10-13 17:08:10,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-10-13 17:08:10,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 119 transitions. [2024-10-13 17:08:10,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:10,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:08:10,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:08:10,122 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:08:10,122 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:08:10,122 INFO L745 eck$LassoCheckResult]: Stem: 11194#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 11188#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 11195#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11189#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 11190#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11191#L521 assume !(main_~val~0#1 < 0); 11184#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11185#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11186#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11192#L521 assume !(main_~val~0#1 < 0); 11271#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11270#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11269#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11268#L521 assume !(main_~val~0#1 < 0); 11267#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11266#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11265#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11264#L521 assume !(main_~val~0#1 < 0); 11263#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11262#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11261#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11260#L521 assume !(main_~val~0#1 < 0); 11259#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11258#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11257#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11256#L521 assume !(main_~val~0#1 < 0); 11255#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11254#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11253#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11252#L521 assume !(main_~val~0#1 < 0); 11251#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11250#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11249#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11248#L521 assume !(main_~val~0#1 < 0); 11247#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11246#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11245#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11244#L521 assume !(main_~val~0#1 < 0); 11243#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11242#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11241#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11198#L521 assume !(main_~val~0#1 < 0); 11204#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 11199#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11197#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 11196#L519-4 main_~j~0#1 := 0; 11181#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11182#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11239#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11238#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11183#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11180#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11193#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11175#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11176#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11236#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11235#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11234#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11233#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11231#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11230#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11229#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11228#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11226#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11225#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11224#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11223#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11221#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11220#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11219#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11218#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11216#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11215#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11214#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11213#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11211#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11210#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11209#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11208#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11207#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11203#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 11202#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 11200#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 11178#L527-3 [2024-10-13 17:08:10,122 INFO L747 eck$LassoCheckResult]: Loop: 11178#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 11177#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 11178#L527-3 [2024-10-13 17:08:10,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1373220406, now seen corresponding path program 19 times [2024-10-13 17:08:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:10,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992275525] [2024-10-13 17:08:10,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:10,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:10,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:10,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:10,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 19 times [2024-10-13 17:08:10,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:10,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690978746] [2024-10-13 17:08:10,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:10,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:10,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:10,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:10,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1109848753, now seen corresponding path program 9 times [2024-10-13 17:08:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:10,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041032498] [2024-10-13 17:08:10,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:10,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:10,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:10,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:15,768 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 330 DAG size of output: 239 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-13 17:08:16,134 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:08:16,135 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:08:16,135 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:08:16,135 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:08:16,135 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:08:16,135 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:16,135 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:08:16,135 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:08:16,135 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration23_Lasso [2024-10-13 17:08:16,135 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:08:16,135 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:08:16,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:16,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:17,555 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:08:17,555 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:08:17,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,557 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-10-13 17:08:17,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-10-13 17:08:17,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,580 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-10-13 17:08:17,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:17,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:17,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:17,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,604 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2024-10-13 17:08:17,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2024-10-13 17:08:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,634 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-10-13 17:08:17,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:17,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,662 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-10-13 17:08:17,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-10-13 17:08:17,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,685 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-10-13 17:08:17,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:17,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:17,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-10-13 17:08:17,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,710 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-10-13 17:08:17,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,733 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-10-13 17:08:17,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:17,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,757 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-10-13 17:08:17,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2024-10-13 17:08:17,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,781 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-10-13 17:08:17,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:17,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:17,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2024-10-13 17:08:17,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,807 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-10-13 17:08:17,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:17,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,830 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-10-13 17:08:17,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,853 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-10-13 17:08:17,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2024-10-13 17:08:17,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,876 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-10-13 17:08:17,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:17,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:17,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:17,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2024-10-13 17:08:17,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,899 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-10-13 17:08:17,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:17,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:17,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-10-13 17:08:17,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,926 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-10-13 17:08:17,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:17,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:17,940 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2024-10-13 17:08:17,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,951 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-10-13 17:08:17,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:17,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:17,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:17,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2024-10-13 17:08:17,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:17,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:17,981 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:17,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-10-13 17:08:17,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:17,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:17,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:17,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:17,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:17,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:17,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:17,997 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:18,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2024-10-13 17:08:18,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:18,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:18,008 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:18,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-10-13 17:08:18,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:18,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:18,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:18,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:18,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:18,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:18,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:18,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:18,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:18,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:18,038 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:18,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-10-13 17:08:18,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:18,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:18,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:18,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:18,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:18,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:18,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:18,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:18,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2024-10-13 17:08:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:18,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:18,068 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:18,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-10-13 17:08:18,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:18,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:18,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:18,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:18,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:18,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:18,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:18,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:18,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2024-10-13 17:08:18,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:18,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:18,096 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:18,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-10-13 17:08:18,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:18,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:18,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:18,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:18,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:18,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:18,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:18,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:18,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2024-10-13 17:08:18,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:18,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:18,124 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:18,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-10-13 17:08:18,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:18,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:18,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:18,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:18,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:18,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:18,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:18,142 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:08:18,149 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-13 17:08:18,149 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-13 17:08:18,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:18,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:18,150 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:18,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-10-13 17:08:18,151 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:08:18,161 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:08:18,162 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:08:18,162 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 36)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 36)_1 Supporting invariants [] [2024-10-13 17:08:18,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2024-10-13 17:08:18,252 INFO L156 tatePredicateManager]: 40 out of 41 supporting invariants were superfluous and have been removed [2024-10-13 17:08:18,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:08:18,254 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:08:18,254 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:08:18,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:18,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 17:08:18,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:18,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:18,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:18,653 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-13 17:08:18,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:18,689 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 121 transitions. Complement of second has 5 states. [2024-10-13 17:08:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:08:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:08:18,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 84 letters. Loop has 2 letters. [2024-10-13 17:08:18,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:18,690 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:08:18,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:18,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 17:08:18,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:18,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:19,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:19,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:19,130 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-13 17:08:19,130 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:19,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 121 transitions. Complement of second has 5 states. [2024-10-13 17:08:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:08:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:08:19,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 84 letters. Loop has 2 letters. [2024-10-13 17:08:19,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:19,164 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:08:19,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:19,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 17:08:19,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:19,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:19,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:19,559 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 2 loop predicates [2024-10-13 17:08:19,559 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34 Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:19,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 119 transitions. cyclomatic complexity: 34. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 120 states and 154 transitions. Complement of second has 27 states. [2024-10-13 17:08:19,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:08:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2024-10-13 17:08:19,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 84 letters. Loop has 2 letters. [2024-10-13 17:08:19,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:19,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 86 letters. Loop has 2 letters. [2024-10-13 17:08:19,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:19,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 81 transitions. Stem has 84 letters. Loop has 4 letters. [2024-10-13 17:08:19,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:19,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 154 transitions. [2024-10-13 17:08:19,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:19,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 115 states and 147 transitions. [2024-10-13 17:08:19,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:08:19,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:08:19,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 147 transitions. [2024-10-13 17:08:19,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:08:19,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 147 transitions. [2024-10-13 17:08:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 147 transitions. [2024-10-13 17:08:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2024-10-13 17:08:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-13 17:08:19,800 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-13 17:08:19,800 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-13 17:08:19,800 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-10-13 17:08:19,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 125 transitions. [2024-10-13 17:08:19,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:19,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:08:19,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:08:19,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:08:19,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:08:19,801 INFO L745 eck$LassoCheckResult]: Stem: 12658#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 12651#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 12659#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 12652#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 12653#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12654#L521 assume !(main_~val~0#1 < 0); 12646#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12647#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12655#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12656#L521 assume !(main_~val~0#1 < 0); 12696#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12648#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12649#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12692#L521 assume !(main_~val~0#1 < 0); 12691#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12690#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12689#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12688#L521 assume !(main_~val~0#1 < 0); 12687#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12686#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12685#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12684#L521 assume !(main_~val~0#1 < 0); 12683#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12682#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12681#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12680#L521 assume !(main_~val~0#1 < 0); 12679#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12678#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12677#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12676#L521 assume !(main_~val~0#1 < 0); 12675#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12674#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12673#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12672#L521 assume !(main_~val~0#1 < 0); 12671#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12670#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12669#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12668#L521 assume !(main_~val~0#1 < 0); 12667#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12666#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12665#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 12662#L521 assume !(main_~val~0#1 < 0); 12664#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12663#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12661#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 12660#L519-4 main_~j~0#1 := 0; 12643#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12644#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12737#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12736#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12645#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12642#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12657#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12637#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12638#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12734#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12733#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12732#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12731#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12729#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12728#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12727#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12726#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12724#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12723#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12722#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12721#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12719#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12718#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12717#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12716#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12714#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12713#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12712#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12711#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12709#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12708#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12707#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12706#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12704#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12703#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12702#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12701#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12700#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12697#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 12695#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 12693#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 12640#L527-3 [2024-10-13 17:08:19,802 INFO L747 eck$LassoCheckResult]: Loop: 12640#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 12639#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 12640#L527-3 [2024-10-13 17:08:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1412762337, now seen corresponding path program 20 times [2024-10-13 17:08:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760477563] [2024-10-13 17:08:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 153 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:20,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:08:20,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760477563] [2024-10-13 17:08:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760477563] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:08:20,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246838182] [2024-10-13 17:08:20,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:08:20,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:08:20,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:20,245 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:08:20,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2024-10-13 17:08:20,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:08:20,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:08:20,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 17:08:20,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:20,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:08:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246838182] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:08:20,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:08:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2024-10-13 17:08:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344008688] [2024-10-13 17:08:20,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:08:20,982 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:08:20,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 20 times [2024-10-13 17:08:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:20,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380047667] [2024-10-13 17:08:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:20,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:20,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:08:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 17:08:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 17:08:21,021 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. cyclomatic complexity: 36 Second operand has 38 states, 37 states have (on average 3.7837837837837838) internal successors, (140), 38 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:08:21,275 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2024-10-13 17:08:21,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 196 transitions. [2024-10-13 17:08:21,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:21,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 109 states and 134 transitions. [2024-10-13 17:08:21,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:08:21,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:08:21,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 134 transitions. [2024-10-13 17:08:21,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:08:21,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 134 transitions. [2024-10-13 17:08:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 134 transitions. [2024-10-13 17:08:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-10-13 17:08:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 105 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2024-10-13 17:08:21,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-10-13 17:08:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 17:08:21,280 INFO L425 stractBuchiCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-10-13 17:08:21,280 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-10-13 17:08:21,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 130 transitions. [2024-10-13 17:08:21,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:21,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:08:21,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:08:21,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:08:21,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:08:21,283 INFO L745 eck$LassoCheckResult]: Stem: 13482#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13475#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 13476#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 13483#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 13477#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 13478#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13479#L521 assume !(main_~val~0#1 < 0); 13472#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13473#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13474#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13480#L521 assume !(main_~val~0#1 < 0); 13568#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13567#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13566#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13565#L521 assume !(main_~val~0#1 < 0); 13564#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13563#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13562#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13561#L521 assume !(main_~val~0#1 < 0); 13560#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13559#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13558#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13557#L521 assume !(main_~val~0#1 < 0); 13556#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13555#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13554#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13553#L521 assume !(main_~val~0#1 < 0); 13552#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13551#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13550#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13549#L521 assume !(main_~val~0#1 < 0); 13548#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13547#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13546#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13545#L521 assume !(main_~val~0#1 < 0); 13544#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13543#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13542#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13541#L521 assume !(main_~val~0#1 < 0); 13540#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13539#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13538#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13537#L521 assume !(main_~val~0#1 < 0); 13536#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13535#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13534#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13486#L521 assume !(main_~val~0#1 < 0); 13492#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13487#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13485#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 13484#L519-4 main_~j~0#1 := 0; 13469#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13470#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13532#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13531#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13471#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13468#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13481#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13463#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13464#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13529#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13528#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13527#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13526#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13524#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13523#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13522#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13521#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13519#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13518#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13517#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13516#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13514#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13513#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13512#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13511#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13509#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13508#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13507#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13506#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13504#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13503#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13502#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13501#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13499#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13498#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13497#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13496#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13495#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13491#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 13490#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 13488#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 13466#L527-3 [2024-10-13 17:08:21,283 INFO L747 eck$LassoCheckResult]: Loop: 13466#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 13465#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 13466#L527-3 [2024-10-13 17:08:21,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2010175208, now seen corresponding path program 21 times [2024-10-13 17:08:21,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061869134] [2024-10-13 17:08:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:21,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:21,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:21,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 21 times [2024-10-13 17:08:21,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:21,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454671073] [2024-10-13 17:08:21,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:21,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:21,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:21,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:21,345 INFO L85 PathProgramCache]: Analyzing trace with hash 956909853, now seen corresponding path program 10 times [2024-10-13 17:08:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:21,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303860615] [2024-10-13 17:08:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:21,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:21,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:30,209 WARN L286 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 359 DAG size of output: 260 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-13 17:08:30,710 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:08:30,710 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:08:30,710 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:08:30,710 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:08:30,710 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:08:30,710 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:30,710 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:08:30,710 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:08:30,710 INFO L132 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration25_Lasso [2024-10-13 17:08:30,710 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:08:30,710 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:08:30,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:30,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:30,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:30,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:30,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:31,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:32,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:08:32,370 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:08:32,371 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:08:32,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,372 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-10-13 17:08:32,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:32,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,397 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-10-13 17:08:32,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:32,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:32,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:32,410 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2024-10-13 17:08:32,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,421 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-10-13 17:08:32,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:32,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,445 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-10-13 17:08:32,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:08:32,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:08:32,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:08:32,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:32,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,469 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-10-13 17:08:32,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2024-10-13 17:08:32,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,494 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-10-13 17:08:32,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2024-10-13 17:08:32,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,522 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-10-13 17:08:32,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2024-10-13 17:08:32,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,549 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-10-13 17:08:32,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2024-10-13 17:08:32,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,577 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-10-13 17:08:32,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2024-10-13 17:08:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,605 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-10-13 17:08:32,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2024-10-13 17:08:32,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,635 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-10-13 17:08:32,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:32,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,664 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-10-13 17:08:32,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,682 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:32,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,692 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-10-13 17:08:32,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,720 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-10-13 17:08:32,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,737 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:08:32,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:32,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,748 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-10-13 17:08:32,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-13 17:08:32,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:08:32,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:08:32,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:08:32,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:08:32,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:08:32,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:08:32,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:08:32,771 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-13 17:08:32,771 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-13 17:08:32,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:08:32,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:32,773 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-13 17:08:32,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-10-13 17:08:32,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:08:32,785 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:08:32,786 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:08:32,786 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~arr~0#1.base) 40)_1 Supporting invariants [] [2024-10-13 17:08:32,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2024-10-13 17:08:32,890 INFO L156 tatePredicateManager]: 44 out of 45 supporting invariants were superfluous and have been removed [2024-10-13 17:08:32,892 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:08:32,892 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:08:32,892 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~arr~0!base,]]] [2024-10-13 17:08:32,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:32,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 17:08:32,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:33,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2024-10-13 17:08:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:33,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:33,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:33,344 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-13 17:08:33,344 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:33,377 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 132 transitions. Complement of second has 5 states. [2024-10-13 17:08:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:08:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:08:33,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 92 letters. Loop has 2 letters. [2024-10-13 17:08:33,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:33,378 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:08:33,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:33,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 17:08:33,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:33,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:33,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:33,843 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-13 17:08:33,844 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:33,879 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 107 states and 132 transitions. Complement of second has 5 states. [2024-10-13 17:08:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2024-10-13 17:08:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-13 17:08:33,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 92 letters. Loop has 2 letters. [2024-10-13 17:08:33,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:33,880 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:08:33,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:33,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 17:08:33,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:34,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 17:08:34,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:34,338 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 2 loop predicates [2024-10-13 17:08:34,338 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37 Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:34,686 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 130 transitions. cyclomatic complexity: 37. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 130 states and 167 transitions. Complement of second has 29 states. [2024-10-13 17:08:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 13 stem states 2 non-accepting loop states 2 accepting loop states [2024-10-13 17:08:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 87 transitions. [2024-10-13 17:08:34,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 92 letters. Loop has 2 letters. [2024-10-13 17:08:34,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:34,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 94 letters. Loop has 2 letters. [2024-10-13 17:08:34,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:34,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 87 transitions. Stem has 92 letters. Loop has 4 letters. [2024-10-13 17:08:34,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:08:34,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 167 transitions. [2024-10-13 17:08:34,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:34,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 160 transitions. [2024-10-13 17:08:34,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-10-13 17:08:34,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-10-13 17:08:34,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 160 transitions. [2024-10-13 17:08:34,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:08:34,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 160 transitions. [2024-10-13 17:08:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 160 transitions. [2024-10-13 17:08:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2024-10-13 17:08:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 110 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2024-10-13 17:08:34,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-10-13 17:08:34,692 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 136 transitions. [2024-10-13 17:08:34,692 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-10-13 17:08:34,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 136 transitions. [2024-10-13 17:08:34,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:34,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:08:34,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:08:34,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:08:34,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:08:34,693 INFO L745 eck$LassoCheckResult]: Stem: 15077#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15070#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 15078#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15071#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15072#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15073#L521 assume !(main_~val~0#1 < 0); 15065#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15066#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15074#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15075#L521 assume !(main_~val~0#1 < 0); 15119#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15067#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15068#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15115#L521 assume !(main_~val~0#1 < 0); 15114#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15113#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15112#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15111#L521 assume !(main_~val~0#1 < 0); 15110#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15109#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15108#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15107#L521 assume !(main_~val~0#1 < 0); 15106#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15105#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15104#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15103#L521 assume !(main_~val~0#1 < 0); 15102#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15101#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15100#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15099#L521 assume !(main_~val~0#1 < 0); 15098#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15097#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15096#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15095#L521 assume !(main_~val~0#1 < 0); 15094#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15093#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15092#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15091#L521 assume !(main_~val~0#1 < 0); 15090#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15089#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15088#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15087#L521 assume !(main_~val~0#1 < 0); 15086#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15085#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15084#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15081#L521 assume !(main_~val~0#1 < 0); 15083#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15082#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15080#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 15079#L519-4 main_~j~0#1 := 0; 15062#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15063#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15165#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15164#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15064#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15061#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15076#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15056#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15057#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15162#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15161#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15160#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15159#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15157#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15156#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15155#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15154#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15152#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15151#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15150#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15149#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15147#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15146#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15145#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15144#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15142#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15141#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15140#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15139#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15137#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15136#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15135#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15134#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15132#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15131#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15130#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15129#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15127#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15126#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15125#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15124#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15123#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15120#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15118#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15116#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15059#L527-3 [2024-10-13 17:08:34,694 INFO L747 eck$LassoCheckResult]: Loop: 15059#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15058#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15059#L527-3 [2024-10-13 17:08:34,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash 467367277, now seen corresponding path program 22 times [2024-10-13 17:08:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833024296] [2024-10-13 17:08:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:08:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 190 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:08:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833024296] [2024-10-13 17:08:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833024296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:08:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192149907] [2024-10-13 17:08:35,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 17:08:35,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:08:35,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:08:35,188 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:08:35,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2024-10-13 17:08:35,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 17:08:35,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:08:35,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 17:08:35,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:08:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:35,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:08:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:08:35,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192149907] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:08:35,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:08:35,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2024-10-13 17:08:35,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379006712] [2024-10-13 17:08:35,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:08:35,986 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-13 17:08:35,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:35,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 22 times [2024-10-13 17:08:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:35,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360750644] [2024-10-13 17:08:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:35,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:35,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:08:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-13 17:08:36,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1258, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 17:08:36,031 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. cyclomatic complexity: 39 Second operand has 41 states, 40 states have (on average 3.8) internal successors, (152), 41 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:08:36,273 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2024-10-13 17:08:36,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 213 transitions. [2024-10-13 17:08:36,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:36,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 118 states and 145 transitions. [2024-10-13 17:08:36,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-10-13 17:08:36,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-13 17:08:36,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 145 transitions. [2024-10-13 17:08:36,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:08:36,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-10-13 17:08:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 145 transitions. [2024-10-13 17:08:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-10-13 17:08:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:08:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2024-10-13 17:08:36,277 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-10-13 17:08:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 17:08:36,278 INFO L425 stractBuchiCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-10-13 17:08:36,278 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-10-13 17:08:36,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 141 transitions. [2024-10-13 17:08:36,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:08:36,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:08:36,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:08:36,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:08:36,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:08:36,280 INFO L745 eck$LassoCheckResult]: Stem: 15975#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15968#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~post9#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;havoc main_#t~nondet2#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 15969#L516 assume !(main_~length~0#1 < 1 || main_~length~0#1 % 4294967296 >= 536870911); 15976#L516-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 4294967296);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 15970#L518 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 15971#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15972#L521 assume !(main_~val~0#1 < 0); 15965#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15966#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15967#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15973#L521 assume !(main_~val~0#1 < 0); 16070#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16069#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16068#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16067#L521 assume !(main_~val~0#1 < 0); 16066#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16065#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16064#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16063#L521 assume !(main_~val~0#1 < 0); 16062#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16061#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16060#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16059#L521 assume !(main_~val~0#1 < 0); 16058#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16057#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16056#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16055#L521 assume !(main_~val~0#1 < 0); 16054#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16053#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16052#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16051#L521 assume !(main_~val~0#1 < 0); 16050#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16049#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16048#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16047#L521 assume !(main_~val~0#1 < 0); 16046#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16045#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16044#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16043#L521 assume !(main_~val~0#1 < 0); 16042#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16041#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16040#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16039#L521 assume !(main_~val~0#1 < 0); 16038#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16037#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16036#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16035#L521 assume !(main_~val~0#1 < 0); 16034#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16033#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 16032#L519-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet4#1;main_~val~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 15979#L521 assume !(main_~val~0#1 < 0); 15985#L521-2 call write~int#0(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15980#L519-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 15978#L519-3 assume !(main_~i~0#1 < main_~length~0#1); 15977#L519-4 main_~j~0#1 := 0; 15962#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15963#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16030#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16029#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15964#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15961#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15974#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15956#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15957#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16027#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16026#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16025#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16024#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16022#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16021#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16020#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16019#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16017#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16016#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16015#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16014#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16012#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16011#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16010#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16009#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16007#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16006#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16005#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 16004#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 16002#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 16001#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 16000#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15999#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15997#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15996#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15995#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15994#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15992#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15991#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15990#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15989#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15988#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15984#L527-1 assume !(main_#t~mem6#1 > 0);havoc main_#t~mem6#1; 15983#L526-2 main_#t~post9#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 15981#L526-3 assume !!(main_~j~0#1 < main_~length~0#1); 15959#L527-3 [2024-10-13 17:08:36,280 INFO L747 eck$LassoCheckResult]: Loop: 15959#L527-3 call main_#t~mem6#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 15958#L527-1 assume !!(main_#t~mem6#1 > 0);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#0(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#0(main_#t~post8#1 - 1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 15959#L527-3 [2024-10-13 17:08:36,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash 753705062, now seen corresponding path program 23 times [2024-10-13 17:08:36,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:36,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496041770] [2024-10-13 17:08:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:36,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:36,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:36,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:36,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 23 times [2024-10-13 17:08:36,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:36,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75109663] [2024-10-13 17:08:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:36,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:36,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:36,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:08:36,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:08:36,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1538906901, now seen corresponding path program 11 times [2024-10-13 17:08:36,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:08:36,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738453297] [2024-10-13 17:08:36,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:08:36,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:08:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:36,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:08:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:08:36,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace