./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 06:54:10,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:54:10,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:54:10,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:54:10,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:54:10,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:54:10,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:54:10,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:54:10,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:54:10,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:54:10,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:54:10,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:54:10,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:54:10,877 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:54:10,877 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:54:10,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:54:10,878 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:54:10,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:54:10,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:54:10,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:54:10,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:54:10,881 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:54:10,881 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-09 06:54:11,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:54:11,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:54:11,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:54:11,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:54:11,117 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:54:11,118 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-09 06:54:12,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24572734f/e6e9175ae87d4cbf94fe5d311f0a3887/FLAGfd1caf960 [2025-03-09 06:54:12,432 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:54:12,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2025-03-09 06:54:12,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24572734f/e6e9175ae87d4cbf94fe5d311f0a3887/FLAGfd1caf960 [2025-03-09 06:54:12,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24572734f/e6e9175ae87d4cbf94fe5d311f0a3887 [2025-03-09 06:54:12,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:54:12,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:54:12,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:54:12,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:54:12,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:54:12,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:54:12" (1/1) ... [2025-03-09 06:54:12,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704005b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:12, skipping insertion in model container [2025-03-09 06:54:12,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:54:12" (1/1) ... [2025-03-09 06:54:12,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:54:12,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:54:12,976 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:54:13,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:54:13,024 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:54:13,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13 WrapperNode [2025-03-09 06:54:13,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:54:13,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:54:13,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:54:13,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:54:13,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,054 INFO L138 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-09 06:54:13,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:54:13,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:54:13,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:54:13,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:54:13,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,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-09 06:54:13,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:54:13,086 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:54:13,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:54:13,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:54:13,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (1/1) ... [2025-03-09 06:54:13,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:13,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:13,109 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-09 06:54:13,111 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-09 06:54:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:54:13,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:54:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:54:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:54:13,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:54:13,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:54:13,191 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:54:13,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:54:13,258 INFO L1307 $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-09 06:54:13,264 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-09 06:54:13,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:54:13,270 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:54:13,271 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:54:13,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:54:13 BoogieIcfgContainer [2025-03-09 06:54:13,271 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:54:13,272 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:54:13,272 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:54:13,276 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:54:13,276 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:54:13,276 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:54:12" (1/3) ... [2025-03-09 06:54:13,278 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cad9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:54:13, skipping insertion in model container [2025-03-09 06:54:13,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:54:13,278 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:54:13" (2/3) ... [2025-03-09 06:54:13,278 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cad9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:54:13, skipping insertion in model container [2025-03-09 06:54:13,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:54:13,278 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:54:13" (3/3) ... [2025-03-09 06:54:13,279 INFO L363 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2025-03-09 06:54:13,315 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:54:13,315 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:54:13,315 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:54:13,315 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:54:13,316 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:54:13,316 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:54:13,316 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:54:13,316 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:54:13,319 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-09 06:54:13,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:54:13,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:13,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:13,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:54:13,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:54:13,334 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:54:13,335 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-09 06:54:13,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:54:13,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:13,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:13,336 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:54:13,336 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:54:13,341 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-09 06:54:13,341 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-09 06:54:13,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1507390, now seen corresponding path program 1 times [2025-03-09 06:54:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747256906] [2025-03-09 06:54:13,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:13,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:54:13,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:54:13,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:13,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:54:13,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:54:13,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:13,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash 42660, now seen corresponding path program 1 times [2025-03-09 06:54:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114682796] [2025-03-09 06:54:13,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:13,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:13,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:13,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:13,479 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-09 06:54:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114682796] [2025-03-09 06:54:13,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114682796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:54:13,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:54:13,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:54:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130268785] [2025-03-09 06:54:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:54:13,484 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:54:13,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:13,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:54:13,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:54:13,506 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-09 06:54:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:13,510 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2025-03-09 06:54:13,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2025-03-09 06:54:13,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:54:13,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2025-03-09 06:54:13,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-09 06:54:13,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:13,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2025-03-09 06:54:13,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:54:13,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-09 06:54:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2025-03-09 06:54:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-09 06:54:13,536 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-09 06:54:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2025-03-09 06:54:13,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-09 06:54:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:54:13,541 INFO L432 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2025-03-09 06:54:13,541 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:54:13,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2025-03-09 06:54:13,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-03-09 06:54:13,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:13,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:13,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 06:54:13,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:54:13,541 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-09 06:54:13,542 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-09 06:54:13,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1507390, now seen corresponding path program 2 times [2025-03-09 06:54:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246647221] [2025-03-09 06:54:13,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:54:13,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:54:13,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:13,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:13,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:54:13,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:54:13,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:13,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,563 INFO L85 PathProgramCache]: Analyzing trace with hash 40971495, now seen corresponding path program 1 times [2025-03-09 06:54:13,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261225061] [2025-03-09 06:54:13,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:13,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:54:13,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:54:13,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:13,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:54:13,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:54:13,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -523121974, now seen corresponding path program 1 times [2025-03-09 06:54:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:13,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520210972] [2025-03-09 06:54:13,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:13,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:13,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:54:13,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:54:13,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:13,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 06:54:13,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 06:54:13,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:13,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:13,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:13,965 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:13,966 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:13,966 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:13,966 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:13,966 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:13,966 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:13,966 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:13,966 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:13,967 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2025-03-09 06:54:13,967 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:13,967 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:13,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:13,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:13,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:13,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:13,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:13,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:14,387 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:14,389 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:14,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,392 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-09 06:54:14,394 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-09 06:54:14,395 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-09 06:54:14,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:14,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:14,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:14,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,422 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-09 06:54:14,424 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-09 06:54:14,425 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-09 06:54:14,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:14,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:14,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:14,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:14,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,446 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-09 06:54:14,448 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-09 06:54:14,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:14,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:14,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:14,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 06:54:14,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,474 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-09 06:54:14,479 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-09 06:54:14,480 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-09 06:54:14,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:14,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:14,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:14,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,502 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-09 06:54:14,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,504 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-09 06:54:14,505 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-09 06:54:14,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:14,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:14,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:14,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:14,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,524 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-09 06:54:14,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,526 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-09 06:54:14,527 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-09 06:54:14,528 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-09 06:54:14,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:14,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:14,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:14,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 06:54:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,552 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-09 06:54:14,553 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-09 06:54:14,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:14,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:14,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:14,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:14,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,577 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-09 06:54:14,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,580 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-09 06:54:14,581 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-09 06:54:14,583 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-09 06:54:14,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:14,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:14,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:14,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,600 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-09 06:54:14,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,602 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-09 06:54:14,604 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-09 06:54:14,608 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-09 06:54:14,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:14,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:14,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:14,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:14,627 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-09 06:54:14,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,630 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-09 06:54:14,631 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-09 06:54:14,632 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-09 06:54:14,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:14,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:14,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:14,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:14,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:14,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:14,661 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:14,684 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:54:14,685 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-09 06:54:14,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:14,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:14,688 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-09 06:54:14,689 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-09 06:54:14,690 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:14,700 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:14,700 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:14,701 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-09 06:54:14,707 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-09 06:54:14,719 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-09 06:54:14,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:14,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:54:14,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:54:14,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:14,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:14,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:14,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:14,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:54:14,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:54:14,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:14,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:14,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:54:14,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:14,828 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-09 06:54:14,830 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-09 06:54:14,835 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-09 06:54:14,835 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-09 06:54:14,867 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-09 06:54:14,868 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-09 06:54:14,869 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-09 06:54:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2025-03-09 06:54:14,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 5 letters. [2025-03-09 06:54:14,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:14,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 5 letters. [2025-03-09 06:54:14,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:14,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 10 letters. [2025-03-09 06:54:14,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:14,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. [2025-03-09 06:54:14,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:54:14,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2025-03-09 06:54:14,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:54:14,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-09 06:54:14,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2025-03-09 06:54:14,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:14,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-03-09 06:54:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2025-03-09 06:54:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-09 06:54:14,874 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-09 06:54:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2025-03-09 06:54:14,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-09 06:54:14,874 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2025-03-09 06:54:14,874 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:54:14,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2025-03-09 06:54:14,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:54:14,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:14,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:14,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-09 06:54:14,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:54:14,875 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-09 06:54:14,875 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-09 06:54:14,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash 46729103, now seen corresponding path program 1 times [2025-03-09 06:54:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:14,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194767286] [2025-03-09 06:54:14,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:14,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:14,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:54:14,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:54:14,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:14,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:14,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:14,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:54:14,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:54:14,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:14,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:14,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:14,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 1 times [2025-03-09 06:54:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:14,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580336501] [2025-03-09 06:54:14,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:14,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:14,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:14,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:14,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:14,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:14,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:14,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:14,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:14,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:14,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 537314427, now seen corresponding path program 1 times [2025-03-09 06:54:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:14,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630680560] [2025-03-09 06:54:14,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:14,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:54:14,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:54:14,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:14,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:14,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:14,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:54:14,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:54:14,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:14,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:14,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:15,180 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:15,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:15,181 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:15,181 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:15,181 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:15,181 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,181 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:15,181 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:15,181 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration3_Lasso [2025-03-09 06:54:15,181 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:15,181 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:15,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,332 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:15,552 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:15,552 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:15,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,555 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-09 06:54:15,556 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-09 06:54:15,557 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-09 06:54:15,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:15,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:15,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:54:15,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,580 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-09 06:54:15,582 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-09 06:54:15,583 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-09 06:54:15,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:15,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:15,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:15,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,600 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-09 06:54:15,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,603 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-09 06:54:15,604 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-09 06:54:15,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:15,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:15,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:15,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:15,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,623 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-09 06:54:15,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,626 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-09 06:54:15,627 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-09 06:54:15,628 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-09 06:54:15,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:15,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:15,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:15,641 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,646 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-09 06:54:15,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,649 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-09 06:54:15,650 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-09 06:54:15,651 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-09 06:54:15,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:15,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:15,666 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,672 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-09 06:54:15,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,675 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-09 06:54:15,675 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-09 06:54:15,678 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-09 06:54:15,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:15,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:15,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:15,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,704 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-09 06:54:15,706 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-09 06:54:15,707 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-09 06:54:15,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:15,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:15,725 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,730 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-09 06:54:15,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,732 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-09 06:54:15,733 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-09 06:54:15,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:15,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:15,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:15,748 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:54:15,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,756 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-09 06:54:15,757 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-09 06:54:15,757 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-09 06:54:15,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:15,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:15,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:15,779 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-09 06:54:15,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,781 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-09 06:54:15,782 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-09 06:54:15,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:15,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:15,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:15,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:15,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:15,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:15,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:15,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:15,838 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-03-09 06:54:15,839 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-09 06:54:15,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:15,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:15,841 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-09 06:54:15,842 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-09 06:54:15,843 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:15,854 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:15,855 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:15,855 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-09 06:54:15,861 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-09 06:54:15,868 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-03-09 06:54:15,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:15,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:54:15,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:54:15,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:15,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:15,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:15,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:15,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:15,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:15,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:15,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:15,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:54:15,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:15,938 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-09 06:54:15,938 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-09 06:54:15,939 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-09 06:54:15,970 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-09 06:54:15,971 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-09 06:54:15,972 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-09 06:54:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2025-03-09 06:54:15,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2025-03-09 06:54:15,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:15,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2025-03-09 06:54:15,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:15,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2025-03-09 06:54:15,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:15,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2025-03-09 06:54:15,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:54:15,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 22 states and 30 transitions. [2025-03-09 06:54:15,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-09 06:54:15,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-09 06:54:15,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2025-03-09 06:54:15,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:15,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-03-09 06:54:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2025-03-09 06:54:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2025-03-09 06:54:15,974 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-09 06:54:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2025-03-09 06:54:15,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2025-03-09 06:54:15,976 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2025-03-09 06:54:15,976 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:54:15,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2025-03-09 06:54:15,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:54:15,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:15,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:15,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:15,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:54:15,979 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-09 06:54:15,979 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-09 06:54:15,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash 963117794, now seen corresponding path program 1 times [2025-03-09 06:54:15,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:15,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742173453] [2025-03-09 06:54:15,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:54:15,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:54:15,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:15,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:16,064 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-09 06:54:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:54:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742173453] [2025-03-09 06:54:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742173453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:54:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:54:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:54:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072786207] [2025-03-09 06:54:16,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:54:16,065 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 06:54:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 40649, now seen corresponding path program 2 times [2025-03-09 06:54:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232047696] [2025-03-09 06:54:16,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:16,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:16,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:16,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:54:16,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:16,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:16,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:16,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:16,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:16,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:16,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:54:16,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:54:16,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:54:16,155 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-09 06:54:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:54:16,185 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2025-03-09 06:54:16,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2025-03-09 06:54:16,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:54:16,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 40 transitions. [2025-03-09 06:54:16,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-09 06:54:16,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-09 06:54:16,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2025-03-09 06:54:16,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:54:16,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-09 06:54:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2025-03-09 06:54:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-03-09 06:54:16,188 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-09 06:54:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-09 06:54:16,188 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-09 06:54:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:54:16,191 INFO L432 stractBuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-09 06:54:16,191 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:54:16,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2025-03-09 06:54:16,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:54:16,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:54:16,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:54:16,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:54:16,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:54:16,193 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-09 06:54:16,193 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-09 06:54:16,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2109602593, now seen corresponding path program 2 times [2025-03-09 06:54:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489272374] [2025-03-09 06:54:16,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:54:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:16,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 06:54:16,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:54:16,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:54:16,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:16,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:16,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:54:16,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:54:16,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:16,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:16,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:16,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash 37829, now seen corresponding path program 3 times [2025-03-09 06:54:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172994606] [2025-03-09 06:54:16,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:54:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:16,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:16,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:16,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:54:16,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:16,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:16,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:16,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:16,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:16,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:16,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:16,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1085586267, now seen corresponding path program 1 times [2025-03-09 06:54:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:54:16,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254589874] [2025-03-09 06:54:16,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:54:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:54:16,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:54:16,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:54:16,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:16,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:16,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:54:16,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:54:16,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:54:16,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:16,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:54:16,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:54:16,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:54:16,699 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:54:16,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:54:16,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:54:16,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:54:16,699 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:54:16,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:16,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:54:16,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:54:16,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2025-03-09 06:54:16,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:54:16,699 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:54:16,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:16,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:54:17,202 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:54:17,202 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:54:17,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,204 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-09 06:54:17,204 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-09 06:54:17,205 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-09 06:54:17,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:17,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:17,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:17,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,221 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-09 06:54:17,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,223 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-09 06:54:17,224 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-09 06:54:17,225 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-09 06:54:17,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:17,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:17,241 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,246 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-09 06:54:17,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,248 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-09 06:54:17,249 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-09 06:54:17,251 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-09 06:54:17,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:17,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:17,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:17,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:17,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,270 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-09 06:54:17,271 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-09 06:54:17,272 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-09 06:54:17,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:17,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:17,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:17,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,289 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-09 06:54:17,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,291 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-09 06:54:17,292 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-09 06:54:17,294 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-09 06:54:17,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:17,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:17,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:17,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:17,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,312 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-09 06:54:17,314 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-09 06:54:17,315 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-09 06:54:17,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:17,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:17,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:17,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,332 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-09 06:54:17,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,334 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-09 06:54:17,335 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-09 06:54:17,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:17,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:17,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:17,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:17,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,353 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-09 06:54:17,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,355 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-09 06:54:17,356 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-09 06:54:17,357 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-09 06:54:17,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:17,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:17,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,374 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-09 06:54:17,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,376 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-09 06:54:17,377 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-09 06:54:17,378 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-09 06:54:17,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:54:17,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:54:17,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:54:17,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,395 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-09 06:54:17,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,397 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-09 06:54:17,398 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-09 06:54:17,398 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-09 06:54:17,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:17,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:17,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,418 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-09 06:54:17,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,420 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-09 06:54:17,421 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-09 06:54:17,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:17,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,433 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 06:54:17,433 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 06:54:17,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,447 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-03-09 06:54:17,447 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-09 06:54:17,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,469 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-09 06:54:17,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,471 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-09 06:54:17,478 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-09 06:54:17,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:54:17,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:17,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:17,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:17,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,502 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-09 06:54:17,503 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-09 06:54:17,505 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-09 06:54:17,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:17,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:17,519 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:54:17,524 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-09 06:54:17,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,526 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-09 06:54:17,527 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-09 06:54:17,528 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-09 06:54:17,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:54:17,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:54:17,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:54:17,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:54:17,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:54:17,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:54:17,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:54:17,569 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 06:54:17,569 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-03-09 06:54:17,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:54:17,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:54:17,571 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-09 06:54:17,573 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-09 06:54:17,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:54:17,584 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:54:17,585 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:54:17,585 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-09 06:54:17,591 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-09 06:54:17,599 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-03-09 06:54:17,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:17,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:54:17,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:54:17,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:17,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:17,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,667 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-09 06:54:17,668 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-09 06:54:17,668 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-09 06:54:17,705 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-09 06:54:17,706 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-09 06:54:17,706 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-09 06:54:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2025-03-09 06:54:17,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-09 06:54:17,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,707 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:17,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:17,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:54:17,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:54:17,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:17,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:17,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,782 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-09 06:54:17,782 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-09 06:54:17,782 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-09 06:54:17,812 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-09 06:54:17,813 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-09 06:54:17,813 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-09 06:54:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2025-03-09 06:54:17,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-09 06:54:17,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,813 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:54:17,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:54:17,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:54:17,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:54:17,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:54:17,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:54:17,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:54:17,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:54:17,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:54:17,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:54:17,891 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-09 06:54:17,892 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-09 06:54:17,892 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-09 06:54:17,928 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-09 06:54:17,929 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-09 06:54:17,929 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-09 06:54:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2025-03-09 06:54:17,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-09 06:54:17,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2025-03-09 06:54:17,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-09 06:54:17,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:54:17,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 102 transitions. [2025-03-09 06:54:17,931 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:54:17,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 0 states and 0 transitions. [2025-03-09 06:54:17,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:54:17,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:54:17,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:54:17,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:54:17,932 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:54:17,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:54:17,932 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:54:17,932 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:54:17,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:54:17,932 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:54:17,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:54:17,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:54:17 BoogieIcfgContainer [2025-03-09 06:54:17,941 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:54:17,942 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:54:17,942 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:54:17,942 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:54:17,943 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:54:13" (3/4) ... [2025-03-09 06:54:17,945 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:54:17,945 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:54:17,946 INFO L158 Benchmark]: Toolchain (without parser) took 5196.85ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.4MB in the beginning and 202.8MB in the end (delta: -92.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2025-03-09 06:54:17,946 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:54:17,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.07ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 94.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:54:17,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.99ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:54:17,947 INFO L158 Benchmark]: Boogie Preprocessor took 29.34ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.6MB in the end (delta: 999.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:54:17,948 INFO L158 Benchmark]: IcfgBuilder took 185.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 79.8MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 06:54:17,948 INFO L158 Benchmark]: BuchiAutomizer took 4669.23ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 79.8MB in the beginning and 204.1MB in the end (delta: -124.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2025-03-09 06:54:17,948 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 285.2MB. Free memory was 204.1MB in the beginning and 202.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:54:17,949 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.19ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.07ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 94.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.99ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.34ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 91.6MB in the end (delta: 999.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 185.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 79.8MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 4669.23ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 79.8MB in the beginning and 204.1MB in the end (delta: -124.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 285.2MB. Free memory was 204.1MB in the beginning and 202.8MB in the end (delta: 1.3MB). 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.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.9s. 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: 44ms 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-09 06:54:17,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-09 06:54:18,160 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