./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:40:27,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:40:27,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-04 15:40:27,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:40:27,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:40:27,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:40:27,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:40:27,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:40:27,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:40:27,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:40:27,855 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:40:27,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:40:27,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:40:27,855 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:40:27,855 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:40:27,855 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:40:27,855 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:40:27,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:40:27,856 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:40:27,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:40:27,857 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:40:27,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:40:27,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:40:27,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:40:27,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:40:27,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:40:27,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:40:27,858 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:40:27,858 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c [2025-03-04 15:40:28,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:40:28,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:40:28,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:40:28,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:40:28,087 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:40:28,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2025-03-04 15:40:29,204 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fed570a7/697ba19f55bd44979b295f96e873d0be/FLAG456d797f4 [2025-03-04 15:40:29,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:40:29,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2025-03-04 15:40:29,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fed570a7/697ba19f55bd44979b295f96e873d0be/FLAG456d797f4 [2025-03-04 15:40:29,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fed570a7/697ba19f55bd44979b295f96e873d0be [2025-03-04 15:40:29,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:40:29,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:40:29,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:40:29,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:40:29,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:40:29,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:40:29" (1/1) ... [2025-03-04 15:40:29,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:29, skipping insertion in model container [2025-03-04 15:40:29,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:40:29" (1/1) ... [2025-03-04 15:40:29,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:40:29,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:40:29,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:40:30,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:40:30,022 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:40:30,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30 WrapperNode [2025-03-04 15:40:30,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:40:30,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:40:30,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:40:30,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:40:30,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,055 INFO L138 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-04 15:40:30,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:40:30,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:40:30,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:40:30,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:40:30,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,076 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 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]. [2025-03-04 15:40:30,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:40:30,093 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:40:30,093 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:40:30,093 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:40:30,094 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (1/1) ... [2025-03-04 15:40:30,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:30,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:30,121 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) [2025-03-04 15:40:30,124 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 [2025-03-04 15:40:30,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:40:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:40:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:40:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:40:30,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:40:30,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:40:30,223 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:40:30,224 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:40:30,333 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-03-04 15:40:30,342 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-04 15:40:30,343 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:40:30,352 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:40:30,352 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:40:30,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:30 BoogieIcfgContainer [2025-03-04 15:40:30,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:40:30,353 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:40:30,354 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:40:30,358 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:40:30,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:40:30,358 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:40:29" (1/3) ... [2025-03-04 15:40:30,359 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b548382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:40:30, skipping insertion in model container [2025-03-04 15:40:30,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:40:30,360 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:40:30" (2/3) ... [2025-03-04 15:40:30,360 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b548382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:40:30, skipping insertion in model container [2025-03-04 15:40:30,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:40:30,360 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:30" (3/3) ... [2025-03-04 15:40:30,361 INFO L363 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2025-03-04 15:40:30,400 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:40:30,401 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:40:30,401 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:40:30,401 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:40:30,401 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:40:30,402 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:40:30,402 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:40:30,402 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:40:30,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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) [2025-03-04 15:40:30,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:40:30,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:30,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:30,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:40:30,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:40:30,421 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:40:30,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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) [2025-03-04 15:40:30,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:40:30,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:30,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:30,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:40:30,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:40:30,426 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem2#1, insertionSort_#t~mem3#1, insertionSort_#t~short4#1, insertionSort_#t~mem5#1, insertionSort_#t~post6#1, insertionSort_#t~pre7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1;" [2025-03-04 15:40:30,426 INFO L754 eck$LassoCheckResult]: Loop: "assume insertionSort_~i~0#1 < insertionSort_~array_size#1;call insertionSort_#t~mem2#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem2#1;havoc insertionSort_#t~mem2#1;insertionSort_~j~0#1 := insertionSort_~i~0#1;" "assume !true;" "call write~int#0(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);insertionSort_#t~pre7#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre7#1;" [2025-03-04 15:40:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1507390, now seen corresponding path program 1 times [2025-03-04 15:40:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112707790] [2025-03-04 15:40:30,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:30,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:40:30,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:40:30,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:30,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:30,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:30,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:40:30,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:40:30,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:30,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:30,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:30,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash 42660, now seen corresponding path program 1 times [2025-03-04 15:40:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643878547] [2025-03-04 15:40:30,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:30,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:30,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:30,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:30,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:40:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643878547] [2025-03-04 15:40:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643878547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:40:30,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:40:30,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:40:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514919853] [2025-03-04 15:40:30,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:40:30,592 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 15:40:30,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:40:30,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:40:30,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:40:30,612 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 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) [2025-03-04 15:40:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:40:30,616 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2025-03-04 15:40:30,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2025-03-04 15:40:30,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:40:30,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2025-03-04 15:40:30,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-04 15:40:30,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:40:30,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2025-03-04 15:40:30,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:40:30,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 15:40:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2025-03-04 15:40:30,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-04 15:40:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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) [2025-03-04 15:40:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2025-03-04 15:40:30,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 15:40:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:40:30,642 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-04 15:40:30,643 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:40:30,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2025-03-04 15:40:30,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-04 15:40:30,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:30,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:30,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:40:30,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-04 15:40:30,644 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem2#1, insertionSort_#t~mem3#1, insertionSort_#t~short4#1, insertionSort_#t~mem5#1, insertionSort_#t~post6#1, insertionSort_#t~pre7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1;" [2025-03-04 15:40:30,644 INFO L754 eck$LassoCheckResult]: Loop: "assume insertionSort_~i~0#1 < insertionSort_~array_size#1;call insertionSort_#t~mem2#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem2#1;havoc insertionSort_#t~mem2#1;insertionSort_~j~0#1 := insertionSort_~i~0#1;" "assume true;insertionSort_#t~short4#1 := insertionSort_~j~0#1 > 0;" "assume insertionSort_#t~short4#1;call insertionSort_#t~mem3#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short4#1 := insertionSort_#t~mem3#1 > insertionSort_~index~0#1;" "assume !insertionSort_#t~short4#1;havoc insertionSort_#t~mem3#1;havoc insertionSort_#t~short4#1;" "call write~int#0(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);insertionSort_#t~pre7#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre7#1;" [2025-03-04 15:40:30,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1507390, now seen corresponding path program 2 times [2025-03-04 15:40:30,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:30,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707353140] [2025-03-04 15:40:30,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:40:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:30,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:40:30,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:40:30,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:40:30,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:30,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:30,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:40:30,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:40:30,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:30,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:30,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:30,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash 40971495, now seen corresponding path program 1 times [2025-03-04 15:40:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:30,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858788656] [2025-03-04 15:40:30,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:30,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:40:30,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:40:30,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:30,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:30,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:30,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:40:30,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:40:30,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:30,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:30,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:30,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash -523121974, now seen corresponding path program 1 times [2025-03-04 15:40:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:30,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58443582] [2025-03-04 15:40:30,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:30,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:30,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:40:30,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:40:30,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:30,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:30,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:30,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:40:30,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:40:30,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:30,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:30,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:31,146 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:40:31,147 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:40:31,147 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:40:31,147 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:40:31,147 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:40:31,147 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,147 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:40:31,147 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:40:31,147 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2025-03-04 15:40:31,147 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:40:31,148 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:40:31,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:31,627 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:40:31,631 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:40:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,634 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) [2025-03-04 15:40:31,636 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 [2025-03-04 15:40:31,637 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 [2025-03-04 15:40:31,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:31,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:31,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:31,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,659 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 [2025-03-04 15:40:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,661 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) [2025-03-04 15:40:31,662 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 [2025-03-04 15:40:31,663 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 [2025-03-04 15:40:31,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:31,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:31,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:31,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,679 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 [2025-03-04 15:40:31,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,681 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) [2025-03-04 15:40:31,683 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 [2025-03-04 15:40:31,683 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 [2025-03-04 15:40:31,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:31,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:31,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:31,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,706 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) [2025-03-04 15:40:31,708 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 [2025-03-04 15:40:31,709 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 [2025-03-04 15:40:31,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:31,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:31,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:31,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,727 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 [2025-03-04 15:40:31,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,729 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) [2025-03-04 15:40:31,731 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 [2025-03-04 15:40:31,732 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 [2025-03-04 15:40:31,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:31,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:31,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:31,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:31,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,752 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) [2025-03-04 15:40:31,753 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 [2025-03-04 15:40:31,755 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 [2025-03-04 15:40:31,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:31,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:31,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:31,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:31,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,776 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) [2025-03-04 15:40:31,777 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 [2025-03-04 15:40:31,779 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 [2025-03-04 15:40:31,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:31,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:31,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:31,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:31,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,799 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) [2025-03-04 15:40:31,799 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 [2025-03-04 15:40:31,801 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 [2025-03-04 15:40:31,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:31,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:31,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:31,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:31,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,825 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) [2025-03-04 15:40:31,826 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 [2025-03-04 15:40:31,827 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 [2025-03-04 15:40:31,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:31,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:31,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:31,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:31,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,847 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) [2025-03-04 15:40:31,848 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 [2025-03-04 15:40:31,849 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 [2025-03-04 15:40:31,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:31,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:31,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:31,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:31,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:31,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:31,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:40:31,890 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-04 15:40:31,892 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 15:40:31,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:31,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:31,896 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) [2025-03-04 15:40:31,897 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 [2025-03-04 15:40:31,899 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:40:31,911 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:40:31,911 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:40:31,912 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size#1, ULTIMATE.start_insertionSort_~i~0#1) = 1*ULTIMATE.start_insertionSort_~array_size#1 - 1*ULTIMATE.start_insertionSort_~i~0#1 Supporting invariants [] [2025-03-04 15:40:31,918 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 [2025-03-04 15:40:31,927 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 15:40:31,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:31,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:40:31,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:40:31,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:31,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:31,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:40:31,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:31,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:40:31,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:40:31,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:31,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:31,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:40:31,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:32,013 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 [2025-03-04 15:40:32,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 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) [2025-03-04 15:40:32,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. 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 15 states and 21 transitions. Complement of second has 4 states. [2025-03-04 15:40:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:40:32,042 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) [2025-03-04 15:40:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-04 15:40:32,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 5 letters. [2025-03-04 15:40:32,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:32,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 5 letters. [2025-03-04 15:40:32,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:32,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 10 letters. [2025-03-04 15:40:32,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:32,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2025-03-04 15:40:32,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:40:32,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2025-03-04 15:40:32,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:40:32,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-04 15:40:32,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-03-04 15:40:32,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:40:32,047 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-04 15:40:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-03-04 15:40:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-04 15:40:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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) [2025-03-04 15:40:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-03-04 15:40:32,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-04 15:40:32,048 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-04 15:40:32,048 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:40:32,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-03-04 15:40:32,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:40:32,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:32,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:32,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-04 15:40:32,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:40:32,048 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem2#1, insertionSort_#t~mem3#1, insertionSort_#t~short4#1, insertionSort_#t~mem5#1, insertionSort_#t~post6#1, insertionSort_#t~pre7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1;" "assume insertionSort_~i~0#1 < insertionSort_~array_size#1;call insertionSort_#t~mem2#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem2#1;havoc insertionSort_#t~mem2#1;insertionSort_~j~0#1 := insertionSort_~i~0#1;" [2025-03-04 15:40:32,048 INFO L754 eck$LassoCheckResult]: Loop: "assume true;insertionSort_#t~short4#1 := insertionSort_~j~0#1 > 0;" "assume insertionSort_#t~short4#1;call insertionSort_#t~mem3#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short4#1 := insertionSort_#t~mem3#1 > insertionSort_~index~0#1;" "assume insertionSort_#t~short4#1;havoc insertionSort_#t~mem3#1;havoc insertionSort_#t~short4#1;call insertionSort_#t~mem5#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);call write~int#0(insertionSort_#t~mem5#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);insertionSort_#t~post6#1 := insertionSort_~j~0#1;insertionSort_~j~0#1 := insertionSort_#t~post6#1 - 1;havoc insertionSort_#t~post6#1;" [2025-03-04 15:40:32,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:32,049 INFO L85 PathProgramCache]: Analyzing trace with hash 46729103, now seen corresponding path program 1 times [2025-03-04 15:40:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:32,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319176392] [2025-03-04 15:40:32,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:32,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:40:32,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:40:32,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:32,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:32,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:32,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:40:32,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:40:32,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:32,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:32,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:32,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 1 times [2025-03-04 15:40:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403700891] [2025-03-04 15:40:32,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:32,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:32,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:32,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:32,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:32,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:32,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:32,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:32,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:32,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:32,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:32,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:32,092 INFO L85 PathProgramCache]: Analyzing trace with hash 537314427, now seen corresponding path program 1 times [2025-03-04 15:40:32,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:32,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080262559] [2025-03-04 15:40:32,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:32,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:32,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:40:32,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:40:32,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:32,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:32,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:32,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:40:32,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:40:32,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:32,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:32,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:32,289 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 [2025-03-04 15:40:32,402 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:40:32,402 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:40:32,402 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:40:32,402 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:40:32,402 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:40:32,402 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,402 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:40:32,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:40:32,402 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration3_Lasso [2025-03-04 15:40:32,402 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:40:32,402 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:40:32,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:32,788 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:40:32,788 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:40:32,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,792 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) [2025-03-04 15:40:32,793 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 [2025-03-04 15:40:32,794 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 [2025-03-04 15:40:32,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:32,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:32,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:32,814 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 [2025-03-04 15:40:32,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,818 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) [2025-03-04 15:40:32,819 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 [2025-03-04 15:40:32,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 [2025-03-04 15:40:32,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:32,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:32,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:32,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:32,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,840 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) [2025-03-04 15:40:32,840 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 [2025-03-04 15:40:32,841 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 [2025-03-04 15:40:32,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:32,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:32,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:32,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:32,859 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 [2025-03-04 15:40:32,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,861 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) [2025-03-04 15:40:32,862 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 [2025-03-04 15:40:32,863 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 [2025-03-04 15:40:32,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:32,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:32,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:32,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:32,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:32,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,883 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) [2025-03-04 15:40:32,884 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 [2025-03-04 15:40:32,886 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 [2025-03-04 15:40:32,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:32,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:32,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:32,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:32,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,910 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) [2025-03-04 15:40:32,912 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 [2025-03-04 15:40:32,913 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 [2025-03-04 15:40:32,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,924 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:32,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:32,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:32,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:40:32,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,934 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2025-03-04 15:40:32,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:40:32,937 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 [2025-03-04 15:40:32,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:32,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:32,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:32,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:32,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,960 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) [2025-03-04 15:40:32,961 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 [2025-03-04 15:40:32,962 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 [2025-03-04 15:40:32,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:32,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:32,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:32,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:32,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:32,983 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) [2025-03-04 15:40:32,984 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 [2025-03-04 15:40:32,985 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 [2025-03-04 15:40:32,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:32,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:32,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:32,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:32,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:32,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:33,002 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:33,008 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 [2025-03-04 15:40:33,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:33,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:33,010 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) [2025-03-04 15:40:33,011 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 [2025-03-04 15:40:33,014 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 [2025-03-04 15:40:33,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:33,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:33,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:33,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:33,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:33,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:33,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:40:33,065 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-03-04 15:40:33,066 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-04 15:40:33,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:33,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:33,068 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2025-03-04 15:40:33,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:40:33,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:40:33,082 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:40:33,082 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:40:33,082 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0#1) = 1*ULTIMATE.start_insertionSort_~j~0#1 Supporting invariants [] [2025-03-04 15:40:33,088 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 [2025-03-04 15:40:33,100 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-04 15:40:33,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:33,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:40:33,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:40:33,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:33,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:33,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:40:33,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:33,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:33,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:33,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:33,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:33,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:40:33,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:33,178 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:40:33,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-04 15:40:33,214 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 32 states and 43 transitions. Complement of second has 9 states. [2025-03-04 15:40:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:40:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-04 15:40:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-04 15:40:33,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-04 15:40:33,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:33,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2025-03-04 15:40:33,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:33,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-04 15:40:33,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:33,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2025-03-04 15:40:33,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:40:33,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 22 states and 30 transitions. [2025-03-04 15:40:33,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-04 15:40:33,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-04 15:40:33,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2025-03-04 15:40:33,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:40:33,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-03-04 15:40:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2025-03-04 15:40:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-03-04 15:40:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) 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) [2025-03-04 15:40:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2025-03-04 15:40:33,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2025-03-04 15:40:33,221 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2025-03-04 15:40:33,221 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:40:33,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2025-03-04 15:40:33,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:40:33,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:33,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:33,223 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:40:33,223 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:40:33,223 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem2#1, insertionSort_#t~mem3#1, insertionSort_#t~short4#1, insertionSort_#t~mem5#1, insertionSort_#t~post6#1, insertionSort_#t~pre7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1;" "assume insertionSort_~i~0#1 < insertionSort_~array_size#1;call insertionSort_#t~mem2#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem2#1;havoc insertionSort_#t~mem2#1;insertionSort_~j~0#1 := insertionSort_~i~0#1;" "assume true;insertionSort_#t~short4#1 := insertionSort_~j~0#1 > 0;" "assume !insertionSort_#t~short4#1;" "assume !insertionSort_#t~short4#1;havoc insertionSort_#t~mem3#1;havoc insertionSort_#t~short4#1;" "call write~int#0(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);insertionSort_#t~pre7#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre7#1;" "assume insertionSort_~i~0#1 < insertionSort_~array_size#1;call insertionSort_#t~mem2#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem2#1;havoc insertionSort_#t~mem2#1;insertionSort_~j~0#1 := insertionSort_~i~0#1;" [2025-03-04 15:40:33,223 INFO L754 eck$LassoCheckResult]: Loop: "assume true;insertionSort_#t~short4#1 := insertionSort_~j~0#1 > 0;" "assume insertionSort_#t~short4#1;call insertionSort_#t~mem3#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short4#1 := insertionSort_#t~mem3#1 > insertionSort_~index~0#1;" "assume insertionSort_#t~short4#1;havoc insertionSort_#t~mem3#1;havoc insertionSort_#t~short4#1;call insertionSort_#t~mem5#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);call write~int#0(insertionSort_#t~mem5#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);insertionSort_#t~post6#1 := insertionSort_~j~0#1;insertionSort_~j~0#1 := insertionSort_#t~post6#1 - 1;havoc insertionSort_#t~post6#1;" [2025-03-04 15:40:33,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash 963117794, now seen corresponding path program 1 times [2025-03-04 15:40:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-03-04 15:40:33,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:33,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:40:33,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:40:33,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:33,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:33,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:33,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:40:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-03-04 15:40:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890222906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:40:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:40:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:40:33,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197675808] [2025-03-04 15:40:33,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:40:33,319 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:40:33,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:33,319 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 2 times [2025-03-04 15:40:33,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:33,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788786271] [2025-03-04 15:40:33,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:40:33,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:33,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:33,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:33,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:40:33,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:33,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:33,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:33,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:33,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:33,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:33,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:40:33,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:40:33,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:40:33,412 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-03-04 15:40:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:40:33,439 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-04 15:40:33,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2025-03-04 15:40:33,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:40:33,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 40 transitions. [2025-03-04 15:40:33,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-04 15:40:33,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-04 15:40:33,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2025-03-04 15:40:33,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:40:33,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-04 15:40:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2025-03-04 15:40:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-03-04 15:40:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 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) [2025-03-04 15:40:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-04 15:40:33,442 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-04 15:40:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:40:33,443 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-04 15:40:33,443 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:40:33,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2025-03-04 15:40:33,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:40:33,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:40:33,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:40:33,444 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:40:33,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:40:33,444 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet8#1;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;" "assume !(main_~array_size~0#1 < 1);" "call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem2#1, insertionSort_#t~mem3#1, insertionSort_#t~short4#1, insertionSort_#t~mem5#1, insertionSort_#t~post6#1, insertionSort_#t~pre7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1;" "assume insertionSort_~i~0#1 < insertionSort_~array_size#1;call insertionSort_#t~mem2#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem2#1;havoc insertionSort_#t~mem2#1;insertionSort_~j~0#1 := insertionSort_~i~0#1;" "assume true;insertionSort_#t~short4#1 := insertionSort_~j~0#1 > 0;" "assume insertionSort_#t~short4#1;call insertionSort_#t~mem3#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short4#1 := insertionSort_#t~mem3#1 > insertionSort_~index~0#1;" "assume !insertionSort_#t~short4#1;havoc insertionSort_#t~mem3#1;havoc insertionSort_#t~short4#1;" "call write~int#0(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);insertionSort_#t~pre7#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre7#1;" "assume insertionSort_~i~0#1 < insertionSort_~array_size#1;call insertionSort_#t~mem2#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem2#1;havoc insertionSort_#t~mem2#1;insertionSort_~j~0#1 := insertionSort_~i~0#1;" "assume true;insertionSort_#t~short4#1 := insertionSort_~j~0#1 > 0;" "assume insertionSort_#t~short4#1;call insertionSort_#t~mem3#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short4#1 := insertionSort_#t~mem3#1 > insertionSort_~index~0#1;" [2025-03-04 15:40:33,444 INFO L754 eck$LassoCheckResult]: Loop: "assume insertionSort_#t~short4#1;havoc insertionSort_#t~mem3#1;havoc insertionSort_#t~short4#1;call insertionSort_#t~mem5#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);call write~int#0(insertionSort_#t~mem5#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);insertionSort_#t~post6#1 := insertionSort_~j~0#1;insertionSort_~j~0#1 := insertionSort_#t~post6#1 - 1;havoc insertionSort_#t~post6#1;" "assume true;insertionSort_#t~short4#1 := insertionSort_~j~0#1 > 0;" "assume insertionSort_#t~short4#1;call insertionSort_#t~mem3#1 := read~int#0(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short4#1 := insertionSort_#t~mem3#1 > insertionSort_~index~0#1;" [2025-03-04 15:40:33,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2109602593, now seen corresponding path program 2 times [2025-03-04 15:40:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972811850] [2025-03-04 15:40:33,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:40:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:33,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 15:40:33,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:40:33,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:40:33,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:33,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:33,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:40:33,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:40:33,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:33,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:33,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:33,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:33,489 INFO L85 PathProgramCache]: Analyzing trace with hash 37829, now seen corresponding path program 3 times [2025-03-04 15:40:33,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:33,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456170226] [2025-03-04 15:40:33,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:40:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:33,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:33,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:33,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:40:33,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:33,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:33,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:33,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:33,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:33,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:33,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:33,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1085586267, now seen corresponding path program 1 times [2025-03-04 15:40:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:40:33,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123554465] [2025-03-04 15:40:33,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:40:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:40:33,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:40:33,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:40:33,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:33,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:33,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:40:33,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:40:33,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:40:33,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:33,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:40:33,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:40:33,951 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:40:33,951 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:40:33,951 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:40:33,951 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:40:33,951 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:40:33,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:33,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:40:33,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:40:33,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2025-03-04 15:40:33,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:40:33,951 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:40:33,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:33,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:34,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:34,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:34,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:34,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:34,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:40:34,435 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:40:34,435 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:40:34,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,437 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) [2025-03-04 15:40:34,438 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 [2025-03-04 15:40:34,439 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 [2025-03-04 15:40:34,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:34,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:34,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:34,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:40:34,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,457 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) [2025-03-04 15:40:34,458 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 [2025-03-04 15:40:34,459 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 [2025-03-04 15:40:34,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:34,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:34,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:40:34,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,480 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) [2025-03-04 15:40:34,480 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 [2025-03-04 15:40:34,482 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 [2025-03-04 15:40:34,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:34,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:34,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:34,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:40:34,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,500 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) [2025-03-04 15:40:34,501 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 [2025-03-04 15:40:34,502 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 [2025-03-04 15:40:34,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:34,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:34,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:34,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,518 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 [2025-03-04 15:40:34,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,520 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) [2025-03-04 15:40:34,521 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 [2025-03-04 15:40:34,522 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 [2025-03-04 15:40:34,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:34,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:34,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:34,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 15:40:34,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,544 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) [2025-03-04 15:40:34,545 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 [2025-03-04 15:40:34,546 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 [2025-03-04 15:40:34,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:34,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:34,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:34,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,564 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 [2025-03-04 15:40:34,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,567 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) [2025-03-04 15:40:34,567 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 [2025-03-04 15:40:34,569 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 [2025-03-04 15:40:34,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:34,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:34,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:34,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,591 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 [2025-03-04 15:40:34,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,593 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) [2025-03-04 15:40:34,598 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 [2025-03-04 15:40:34,598 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 [2025-03-04 15:40:34,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:34,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:34,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 15:40:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,624 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) [2025-03-04 15:40:34,625 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 [2025-03-04 15:40:34,626 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 [2025-03-04 15:40:34,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:40:34,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:40:34,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:40:34,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 15:40:34,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,646 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) [2025-03-04 15:40:34,648 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 [2025-03-04 15:40:34,649 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 [2025-03-04 15:40:34,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:34,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:34,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:40:34,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,669 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) [2025-03-04 15:40:34,669 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 [2025-03-04 15:40:34,670 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 [2025-03-04 15:40:34,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,681 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-04 15:40:34,681 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-04 15:40:34,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,694 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-03-04 15:40:34,694 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-04 15:40:34,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:40:34,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,721 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) [2025-03-04 15:40:34,721 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 [2025-03-04 15:40:34,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 [2025-03-04 15:40:34,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:34,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:34,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:40:34,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,748 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) [2025-03-04 15:40:34,749 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 [2025-03-04 15:40:34,750 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 [2025-03-04 15:40:34,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:34,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:34,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:40:34,771 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 [2025-03-04 15:40:34,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,773 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) [2025-03-04 15:40:34,775 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 [2025-03-04 15:40:34,776 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 [2025-03-04 15:40:34,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:40:34,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:40:34,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:40:34,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:40:34,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-04 15:40:34,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-04 15:40:34,799 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:40:34,816 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-04 15:40:34,816 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-04 15:40:34,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:40:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:40:34,818 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) [2025-03-04 15:40:34,818 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 [2025-03-04 15:40:34,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:40:34,829 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-04 15:40:34,830 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:40:34,830 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0#1) = 1*ULTIMATE.start_insertionSort_~j~0#1 Supporting invariants [] [2025-03-04 15:40:34,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:40:34,847 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-04 15:40:34,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:34,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:40:34,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:40:34,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:34,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:34,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:40:34,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:34,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:34,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:34,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:34,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:34,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:40:34,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:34,924 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:40:34,924 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 15:40:34,956 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 45 states and 61 transitions. Complement of second has 9 states. [2025-03-04 15:40:34,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:40:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 15:40:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2025-03-04 15:40:34,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-04 15:40:34,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:34,958 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:40:34,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:34,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:40:34,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:40:34,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:34,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:34,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:40:34,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:34,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:34,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:34,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:34,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:34,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:40:34,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:35,022 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:40:35,022 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 15:40:35,051 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 36 states and 46 transitions. Complement of second has 9 states. [2025-03-04 15:40:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:40:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 15:40:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-03-04 15:40:35,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-04 15:40:35,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:35,056 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-04 15:40:35,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:40:35,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:40:35,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:40:35,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:35,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:35,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:40:35,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:35,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:40:35,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:40:35,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:40:35,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:40:35,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:40:35,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:40:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:40:35,125 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-04 15:40:35,125 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 15:40:35,161 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 72 states and 102 transitions. Complement of second has 10 states. [2025-03-04 15:40:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-04 15:40:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 15:40:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2025-03-04 15:40:35,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-04 15:40:35,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:35,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2025-03-04 15:40:35,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:35,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-04 15:40:35,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:40:35,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 102 transitions. [2025-03-04 15:40:35,164 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:40:35,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 0 states and 0 transitions. [2025-03-04 15:40:35,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:40:35,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:40:35,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:40:35,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:40:35,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:40:35,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:40:35,165 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:40:35,165 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:40:35,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:40:35,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:40:35,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:40:35,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:40:35 BoogieIcfgContainer [2025-03-04 15:40:35,171 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:40:35,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:40:35,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:40:35,171 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:40:35,172 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:40:30" (3/4) ... [2025-03-04 15:40:35,173 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:40:35,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:40:35,174 INFO L158 Benchmark]: Toolchain (without parser) took 5400.82ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 85.5MB in the end (delta: 34.8MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2025-03-04 15:40:35,174 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:40:35,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.69ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 104.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:40:35,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:40:35,175 INFO L158 Benchmark]: Boogie Preprocessor took 35.19ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 101.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:40:35,175 INFO L158 Benchmark]: IcfgBuilder took 259.90ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 88.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:40:35,175 INFO L158 Benchmark]: BuchiAutomizer took 4817.21ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 85.6MB in the end (delta: 3.2MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2025-03-04 15:40:35,175 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 167.8MB. Free memory was 85.6MB in the beginning and 85.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:40:35,176 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.69ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 104.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.19ms. Allocated memory is still 167.8MB. Free memory was 102.7MB in the beginning and 101.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 259.90ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 88.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4817.21ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 85.6MB in the end (delta: 3.2MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 167.8MB. Free memory was 85.6MB in the beginning and 85.5MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (array_size + ((long) -1 * i)) and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 71 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital151 mio100 ax112 hnf100 lsp94 ukn67 mio100 lsp51 div166 bol100 ite100 ukn100 eq150 hnf94 smp72 dnf130 smp84 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 6 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:40:35,186 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 [2025-03-04 15:40:35,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE