./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:27:35,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:27:35,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-08 14:27:35,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:27:35,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:27:35,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:27:35,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:27:35,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:27:35,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:27:35,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:27:35,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:27:35,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:27:35,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:27:35,130 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:27:35,130 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:27:35,130 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:27:35,130 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:27:35,130 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:27:35,130 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:27:35,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:27:35,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:27:35,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:27:35,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:27:35,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:27:35,132 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:27:35,132 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-jdk21/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 -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2025-02-08 14:27:35,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:27:35,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:27:35,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:27:35,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:27:35,329 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:27:35,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-02-08 14:27:36,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39d9dfb8d/6f29a8dfd91d42c3867334db9b226afa/FLAG3036702a2 [2025-02-08 14:27:36,756 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:27:36,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-02-08 14:27:36,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39d9dfb8d/6f29a8dfd91d42c3867334db9b226afa/FLAG3036702a2 [2025-02-08 14:27:37,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39d9dfb8d/6f29a8dfd91d42c3867334db9b226afa [2025-02-08 14:27:37,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:27:37,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:27:37,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:27:37,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:27:37,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:27:37,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75254f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37, skipping insertion in model container [2025-02-08 14:27:37,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:27:37,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:27:37,260 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:27:37,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:27:37,280 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:27:37,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37 WrapperNode [2025-02-08 14:27:37,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:27:37,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:27:37,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:27:37,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:27:37,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,301 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-02-08 14:27:37,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:27:37,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:27:37,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:27:37,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:27:37,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,318 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-02-08 14:27:37,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:27:37,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:27:37,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:27:37,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:27:37,331 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (1/1) ... [2025-02-08 14:27:37,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:37,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:37,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:37,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-08 14:27:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:27:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:27:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2025-02-08 14:27:37,385 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2025-02-08 14:27:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:27:37,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:27:37,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:27:37,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:27:37,436 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:27:37,437 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:27:37,544 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-08 14:27:37,544 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:27:37,549 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:27:37,549 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:27:37,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:27:37 BoogieIcfgContainer [2025-02-08 14:27:37,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:27:37,550 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:27:37,550 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:27:37,554 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:27:37,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:37,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:27:37" (1/3) ... [2025-02-08 14:27:37,555 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d7b38b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:27:37, skipping insertion in model container [2025-02-08 14:27:37,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:37,555 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:37" (2/3) ... [2025-02-08 14:27:37,555 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d7b38b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:27:37, skipping insertion in model container [2025-02-08 14:27:37,555 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:37,555 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:27:37" (3/3) ... [2025-02-08 14:27:37,556 INFO L363 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2025-02-08 14:27:37,584 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:27:37,585 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:27:37,585 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:27:37,585 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:27:37,585 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:27:37,585 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:27:37,585 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:27:37,585 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:27:37,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 14:27:37,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-08 14:27:37,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:37,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:37,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:27:37,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:27:37,604 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:27:37,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 14:27:37,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-02-08 14:27:37,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:37,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:37,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:27:37,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:27:37,611 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" [2025-02-08 14:27:37,611 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" [2025-02-08 14:27:37,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 1 times [2025-02-08 14:27:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:37,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128016080] [2025-02-08 14:27:37,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:37,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:37,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:37,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:37,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:37,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:37,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:37,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:37,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:37,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2025-02-08 14:27:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510389130] [2025-02-08 14:27:37,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:37,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:37,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:37,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:37,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:37,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:37,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:37,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:37,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:37,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:37,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash 53586, now seen corresponding path program 1 times [2025-02-08 14:27:37,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749061733] [2025-02-08 14:27:37,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:37,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:37,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:37,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:37,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:37,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:37,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:37,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:37,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:37,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:37,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:37,909 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:37,910 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:37,910 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:37,910 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:37,910 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:37,910 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:37,910 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:37,910 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:37,910 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2025-02-08 14:27:37,910 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:37,911 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:37,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:37,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:37,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:37,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:38,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:38,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:38,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:38,163 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:38,166 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:38,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:38,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:38,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-08 14:27:38,173 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-02-08 14:27:38,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:38,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:38,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:38,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:38,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:38,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:38,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:38,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:38,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:38,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:38,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:38,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:38,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-08 14:27:38,211 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-02-08 14:27:38,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:38,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:38,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:38,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:38,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:38,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:38,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:38,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:38,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:38,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:38,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:38,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-08 14:27:38,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:38,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:38,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:38,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:38,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:38,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:38,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:38,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:38,245 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:38,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-08 14:27:38,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:38,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:38,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:38,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-08 14:27:38,256 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-02-08 14:27:38,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:38,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:38,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:38,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:38,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:38,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:38,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:38,296 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-08 14:27:38,299 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-02-08 14:27:38,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:38,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:38,302 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:38,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-08 14:27:38,304 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:38,320 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:27:38,320 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:38,321 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -4*ULTIMATE.start_main_~i~0#1 + 18446744073709551609 Supporting invariants [1*ULTIMATE.start_main_~a~0#1.offset - 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 + 18446744073709551612 >= 0] [2025-02-08 14:27:38,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-08 14:27:38,334 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-02-08 14:27:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:38,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:38,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:38,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:27:38,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:38,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:38,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:38,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:38,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:27:38,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:38,408 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-08 14:27:38,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-02-08 14:27:38,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2). 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) Result 19 states and 25 transitions. Complement of second has 3 states. [2025-02-08 14:27:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-08 14:27:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2025-02-08 14:27:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-08 14:27:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:38,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-08 14:27:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:38,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-08 14:27:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:38,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2025-02-08 14:27:38,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:38,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 12 states and 17 transitions. [2025-02-08 14:27:38,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-02-08 14:27:38,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:27:38,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2025-02-08 14:27:38,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:38,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-08 14:27:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2025-02-08 14:27:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-08 14:27:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2025-02-08 14:27:38,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-08 14:27:38,473 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2025-02-08 14:27:38,474 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:27:38,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2025-02-08 14:27:38,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:38,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:38,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:38,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:27:38,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-08 14:27:38,475 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< [2025-02-08 14:27:38,475 INFO L754 eck$LassoCheckResult]: Loop: "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume !true;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< [2025-02-08 14:27:38,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1661163, now seen corresponding path program 1 times [2025-02-08 14:27:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330120756] [2025-02-08 14:27:38,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:38,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:27:38,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:27:38,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:38,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:38,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330120756] [2025-02-08 14:27:38,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330120756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:38,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:38,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:27:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820965262] [2025-02-08 14:27:38,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:38,528 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:38,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash 40972323, now seen corresponding path program 1 times [2025-02-08 14:27:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:38,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582340222] [2025-02-08 14:27:38,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:38,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:38,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:27:38,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:27:38,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:38,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582340222] [2025-02-08 14:27:38,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582340222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:38,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:38,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:27:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286578111] [2025-02-08 14:27:38,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:38,540 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:27:38,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:38,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:27:38,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:27:38,542 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:38,550 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2025-02-08 14:27:38,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2025-02-08 14:27:38,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:38,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 15 transitions. [2025-02-08 14:27:38,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-02-08 14:27:38,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-02-08 14:27:38,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2025-02-08 14:27:38,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:38,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-02-08 14:27:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2025-02-08 14:27:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-08 14:27:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2025-02-08 14:27:38,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-02-08 14:27:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:27:38,553 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-02-08 14:27:38,553 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:27:38,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2025-02-08 14:27:38,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:38,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:38,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:38,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:27:38,554 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:38,554 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< [2025-02-08 14:27:38,554 INFO L754 eck$LassoCheckResult]: Loop: "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< [2025-02-08 14:27:38,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 51496701, now seen corresponding path program 1 times [2025-02-08 14:27:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:38,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700347174] [2025-02-08 14:27:38,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:38,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:27:38,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:27:38,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:38,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:27:38,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:27:38,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:38,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash 718902080, now seen corresponding path program 1 times [2025-02-08 14:27:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:38,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632041841] [2025-02-08 14:27:38,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:38,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:38,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:38,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:38,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:38,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:38,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:38,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash 755316932, now seen corresponding path program 1 times [2025-02-08 14:27:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:38,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256171672] [2025-02-08 14:27:38,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:38,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:27:38,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:27:38,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:38,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-08 14:27:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:27:38,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:38,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256171672] [2025-02-08 14:27:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256171672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:38,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:38,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:27:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608090476] [2025-02-08 14:27:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:38,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:27:38,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:27:38,988 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:39,029 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2025-02-08 14:27:39,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2025-02-08 14:27:39,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:39,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 22 transitions. [2025-02-08 14:27:39,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-08 14:27:39,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-02-08 14:27:39,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2025-02-08 14:27:39,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:39,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-02-08 14:27:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2025-02-08 14:27:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-02-08 14:27:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-02-08 14:27:39,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-02-08 14:27:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:27:39,033 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-02-08 14:27:39,033 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:27:39,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2025-02-08 14:27:39,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:39,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:39,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:39,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:39,034 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:39,034 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-08 14:27:39,034 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-08 14:27:39,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -812620917, now seen corresponding path program 1 times [2025-02-08 14:27:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849956992] [2025-02-08 14:27:39,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:27:39,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:27:39,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:39,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:27:39,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:27:39,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:39,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash -20449328, now seen corresponding path program 2 times [2025-02-08 14:27:39,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376244617] [2025-02-08 14:27:39,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:39,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:39,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:27:39,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:39,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:39,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:39,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:39,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1594596090, now seen corresponding path program 1 times [2025-02-08 14:27:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715392910] [2025-02-08 14:27:39,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:39,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:27:39,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:27:39,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715392910] [2025-02-08 14:27:39,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715392910] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283583530] [2025-02-08 14:27:39,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:39,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:27:39,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 14:27:39,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:27:39,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:27:39,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:39,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 14:27:39,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:39,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283583530] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:39,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:39,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-02-08 14:27:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430485008] [2025-02-08 14:27:39,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:39,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:39,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 14:27:39,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-08 14:27:39,831 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 18 states, 15 states have (on average 2.066666666666667) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:39,897 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-02-08 14:27:39,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2025-02-08 14:27:39,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:39,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 21 transitions. [2025-02-08 14:27:39,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-02-08 14:27:39,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-02-08 14:27:39,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2025-02-08 14:27:39,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:39,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-02-08 14:27:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2025-02-08 14:27:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-08 14:27:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-02-08 14:27:39,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-02-08 14:27:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:27:39,900 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-02-08 14:27:39,900 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:27:39,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2025-02-08 14:27:39,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:39,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:39,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:39,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:39,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:39,901 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-08 14:27:39,901 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-08 14:27:39,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1580104733, now seen corresponding path program 2 times [2025-02-08 14:27:39,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153401017] [2025-02-08 14:27:39,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 14:27:39,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:27:39,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:39,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:39,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:27:39,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:27:39,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:39,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash -20449328, now seen corresponding path program 3 times [2025-02-08 14:27:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075485793] [2025-02-08 14:27:39,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:39,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:39,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:27:39,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,931 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:39,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:39,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:39,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:39,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1597432884, now seen corresponding path program 2 times [2025-02-08 14:27:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331226451] [2025-02-08 14:27:39,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:39,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:27:39,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:27:39,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:39,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:39,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:27:39,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:27:39,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:40,775 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:40,776 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:40,776 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:40,776 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:40,776 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:40,776 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:40,776 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:40,776 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:40,776 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration5_Lasso [2025-02-08 14:27:40,776 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:40,776 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:40,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:40,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:40,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:40,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:40,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:40,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:40,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:40,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,812 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:41,813 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:41,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:41,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-08 14:27:41,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:41,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,836 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:41,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-08 14:27:41,839 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-02-08 14:27:41,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:41,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-08 14:27:41,861 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-02-08 14:27:41,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,880 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:41,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-08 14:27:41,882 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-02-08 14:27:41,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,894 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-08 14:27:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,901 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:41,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-08 14:27:41,903 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-02-08 14:27:41,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,923 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:41,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-08 14:27:41,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:41,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:41,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:41,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,954 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:41,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-08 14:27:41,956 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-02-08 14:27:41,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:41,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:42,002 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:42,031 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-08 14:27:42,031 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-02-08 14:27:42,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:42,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:42,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-08 14:27:42,035 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:42,045 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:27:42,045 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:42,045 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0, insertionSort_~size) = -1*insertionSort_~j~0 + 1*insertionSort_~size Supporting invariants [] [2025-02-08 14:27:42,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-08 14:27:42,062 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-02-08 14:27:42,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:27:42,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:27:42,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:27:42,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:42,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:42,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:42,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 14:27:42,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:42,167 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-02-08 14:27:42,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:42,219 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 41 transitions. Complement of second has 16 states. [2025-02-08 14:27:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2025-02-08 14:27:42,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 11 letters. Loop has 7 letters. [2025-02-08 14:27:42,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:42,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 18 letters. Loop has 7 letters. [2025-02-08 14:27:42,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:42,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 11 letters. Loop has 14 letters. [2025-02-08 14:27:42,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:42,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 41 transitions. [2025-02-08 14:27:42,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:42,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 29 states and 35 transitions. [2025-02-08 14:27:42,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-08 14:27:42,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-08 14:27:42,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2025-02-08 14:27:42,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:42,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-02-08 14:27:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2025-02-08 14:27:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-02-08 14:27:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-02-08 14:27:42,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-02-08 14:27:42,227 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-02-08 14:27:42,227 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:27:42,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2025-02-08 14:27:42,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-02-08 14:27:42,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:42,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:42,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:42,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:27:42,227 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-08 14:27:42,227 INFO L754 eck$LassoCheckResult]: Loop: "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-08 14:27:42,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1597432916, now seen corresponding path program 1 times [2025-02-08 14:27:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167160648] [2025-02-08 14:27:42,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:42,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:27:42,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:27:42,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 14:27:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167160648] [2025-02-08 14:27:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167160648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:42,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:42,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:27:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261291900] [2025-02-08 14:27:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:42,251 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:42,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash 38663, now seen corresponding path program 1 times [2025-02-08 14:27:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:42,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56480650] [2025-02-08 14:27:42,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:42,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:42,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:42,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:42,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:42,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:42,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:42,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:42,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:27:42,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:27:42,323 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:42,328 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-02-08 14:27:42,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2025-02-08 14:27:42,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:27:42,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 35 transitions. [2025-02-08 14:27:42,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-08 14:27:42,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-02-08 14:27:42,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 35 transitions. [2025-02-08 14:27:42,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:42,329 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-08 14:27:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 35 transitions. [2025-02-08 14:27:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-02-08 14:27:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-02-08 14:27:42,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-08 14:27:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:27:42,331 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-02-08 14:27:42,331 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:27:42,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2025-02-08 14:27:42,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:27:42,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:42,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:42,331 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:42,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:27:42,332 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-08 14:27:42,332 INFO L754 eck$LassoCheckResult]: Loop: "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-08 14:27:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1597432885, now seen corresponding path program 1 times [2025-02-08 14:27:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:42,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029142809] [2025-02-08 14:27:42,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:42,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:27:42,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:27:42,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:42,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:27:42,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:27:42,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:42,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,358 INFO L85 PathProgramCache]: Analyzing trace with hash 38663, now seen corresponding path program 2 times [2025-02-08 14:27:42,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:42,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217023613] [2025-02-08 14:27:42,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:42,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:42,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:42,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:27:42,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:42,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:42,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:42,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:42,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash 885446227, now seen corresponding path program 2 times [2025-02-08 14:27:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276069283] [2025-02-08 14:27:42,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:42,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 14:27:42,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:42,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:42,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-08 14:27:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:27:42,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:42,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276069283] [2025-02-08 14:27:42,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276069283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:42,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821490028] [2025-02-08 14:27:42,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:42,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:42,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,672 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:27:42,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 14:27:42,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 14:27:42,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:42,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:42,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 14:27:42,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:27:42,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:27:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821490028] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:42,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2025-02-08 14:27:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262720024] [2025-02-08 14:27:42,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:42,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 14:27:42,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-08 14:27:42,901 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:43,219 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2025-02-08 14:27:43,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 106 transitions. [2025-02-08 14:27:43,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-02-08 14:27:43,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 106 transitions. [2025-02-08 14:27:43,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-02-08 14:27:43,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-02-08 14:27:43,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 106 transitions. [2025-02-08 14:27:43,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:43,221 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 106 transitions. [2025-02-08 14:27:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 106 transitions. [2025-02-08 14:27:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2025-02-08 14:27:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-02-08 14:27:43,224 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-02-08 14:27:43,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 14:27:43,225 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-02-08 14:27:43,225 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:27:43,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2025-02-08 14:27:43,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2025-02-08 14:27:43,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:43,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:43,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:43,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:43,226 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-08 14:27:43,226 INFO L754 eck$LassoCheckResult]: Loop: "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" [2025-02-08 14:27:43,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:43,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1597432885, now seen corresponding path program 3 times [2025-02-08 14:27:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693003004] [2025-02-08 14:27:43,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:43,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-02-08 14:27:43,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:27:43,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 14:27:43,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:43,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:27:43,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:27:43,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:43,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1810485293, now seen corresponding path program 1 times [2025-02-08 14:27:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740995095] [2025-02-08 14:27:43,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:43,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:27:43,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:27:43,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:43,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:43,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:27:43,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:27:43,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:43,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:43,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:43,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1387789471, now seen corresponding path program 4 times [2025-02-08 14:27:43,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:43,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455251341] [2025-02-08 14:27:43,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:27:43,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:43,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-08 14:27:43,282 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 14:27:43,282 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:27:43,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:27:43,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:43,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455251341] [2025-02-08 14:27:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455251341] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:43,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017027491] [2025-02-08 14:27:43,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:27:43,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:43,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:43,468 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:27:43,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 14:27:43,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-08 14:27:43,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 14:27:43,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:27:43,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:43,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 14:27:43,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:27:43,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:27:43,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017027491] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:43,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:43,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 24 [2025-02-08 14:27:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735146437] [2025-02-08 14:27:43,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:44,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 14:27:44,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-02-08 14:27:44,222 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. cyclomatic complexity: 16 Second operand has 24 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 17 states have internal predecessors, (46), 5 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:44,333 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-02-08 14:27:44,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 71 transitions. [2025-02-08 14:27:44,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:27:44,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 38 states and 44 transitions. [2025-02-08 14:27:44,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-02-08 14:27:44,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-08 14:27:44,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2025-02-08 14:27:44,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:44,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-08 14:27:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2025-02-08 14:27:44,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 14:27:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-02-08 14:27:44,336 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-08 14:27:44,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:27:44,336 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-02-08 14:27:44,336 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:27:44,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 44 transitions. [2025-02-08 14:27:44,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-02-08 14:27:44,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:44,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:44,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:44,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:44,337 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-08 14:27:44,337 INFO L754 eck$LassoCheckResult]: Loop: "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-08 14:27:44,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:44,337 INFO L85 PathProgramCache]: Analyzing trace with hash 693941798, now seen corresponding path program 5 times [2025-02-08 14:27:44,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:44,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700239437] [2025-02-08 14:27:44,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:27:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:44,347 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-02-08 14:27:44,360 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:44,363 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 14:27:44,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:44,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:27:44,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:44,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1967029433, now seen corresponding path program 1 times [2025-02-08 14:27:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204947320] [2025-02-08 14:27:44,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:44,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:44,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:44,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:44,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:44,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:44,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:44,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:44,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:44,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1708425972, now seen corresponding path program 6 times [2025-02-08 14:27:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:44,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108832836] [2025-02-08 14:27:44,396 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:27:44,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:44,403 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-02-08 14:27:44,420 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 14:27:44,420 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-08 14:27:44,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 14:27:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:44,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108832836] [2025-02-08 14:27:44,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108832836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:44,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169422939] [2025-02-08 14:27:44,631 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:27:44,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:44,634 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:27:44,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 14:27:44,685 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-02-08 14:27:44,712 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 14:27:44,712 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-08 14:27:44,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:44,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 14:27:44,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 14:27:44,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 14:27:44,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169422939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:44,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:44,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-02-08 14:27:44,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512852567] [2025-02-08 14:27:44,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:45,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:45,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 14:27:45,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2025-02-08 14:27:45,281 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. cyclomatic complexity: 9 Second operand has 26 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 7 states have call successors, (7), 6 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:45,560 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-02-08 14:27:45,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 58 transitions. [2025-02-08 14:27:45,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-02-08 14:27:45,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 58 transitions. [2025-02-08 14:27:45,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-02-08 14:27:45,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-02-08 14:27:45,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 58 transitions. [2025-02-08 14:27:45,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:45,562 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-02-08 14:27:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 58 transitions. [2025-02-08 14:27:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2025-02-08 14:27:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-02-08 14:27:45,563 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-08 14:27:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 14:27:45,564 INFO L432 stractBuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-02-08 14:27:45,564 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:27:45,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2025-02-08 14:27:45,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2025-02-08 14:27:45,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:45,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:45,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:45,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:45,565 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-08 14:27:45,565 INFO L754 eck$LassoCheckResult]: Loop: "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" [2025-02-08 14:27:45,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash 693941798, now seen corresponding path program 7 times [2025-02-08 14:27:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:45,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915500156] [2025-02-08 14:27:45,569 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:27:45,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:45,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:27:45,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:45,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:45,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:45,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:45,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:27:45,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:45,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:45,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:45,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1549057991, now seen corresponding path program 2 times [2025-02-08 14:27:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39748862] [2025-02-08 14:27:45,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:45,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-08 14:27:45,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:27:45,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:45,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:45,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:45,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:27:45,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:27:45,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:45,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:45,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:45,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash -499880396, now seen corresponding path program 8 times [2025-02-08 14:27:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:45,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698638569] [2025-02-08 14:27:45,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:45,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-08 14:27:45,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:27:45,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:45,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:45,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:45,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 14:27:45,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 14:27:45,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:45,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:45,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:47,325 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:47,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:47,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:47,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:47,325 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:47,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:47,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:47,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:47,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration10_Lasso [2025-02-08 14:27:47,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:47,325 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:47,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:47,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,863 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:48,863 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:48,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:48,865 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:48,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-08 14:27:48,868 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-02-08 14:27:48,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:48,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:48,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:48,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:48,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:48,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:48,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:48,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:48,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:48,890 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:48,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-08 14:27:48,892 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-02-08 14:27:48,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:48,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:48,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:48,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:48,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:48,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:48,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:48,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:48,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:48,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:48,911 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:48,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-08 14:27:48,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:48,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:48,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:48,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:48,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:48,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:48,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:48,930 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:48,944 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-02-08 14:27:48,944 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-02-08 14:27:48,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:48,949 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:48,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-08 14:27:48,982 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:48,993 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:27:48,993 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:48,993 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i) = -2*insertionSort_~i + 3 Supporting invariants [] [2025-02-08 14:27:49,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-08 14:27:49,023 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2025-02-08 14:27:49,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:49,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:27:49,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:49,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:27:49,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:49,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:27:49,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:27:49,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:49,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:49,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:27:49,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:49,217 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2025-02-08 14:27:49,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 49 transitions. cyclomatic complexity: 9 Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:49,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 49 transitions. cyclomatic complexity: 9. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 146 states and 175 transitions. Complement of second has 53 states. [2025-02-08 14:27:49,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2025-02-08 14:27:49,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 38 transitions. Stem has 21 letters. Loop has 13 letters. [2025-02-08 14:27:49,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:49,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 38 transitions. Stem has 34 letters. Loop has 13 letters. [2025-02-08 14:27:49,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:49,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 38 transitions. Stem has 21 letters. Loop has 26 letters. [2025-02-08 14:27:49,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:49,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 175 transitions. [2025-02-08 14:27:49,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-02-08 14:27:49,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 142 states and 171 transitions. [2025-02-08 14:27:49,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-02-08 14:27:49,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-02-08 14:27:49,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 171 transitions. [2025-02-08 14:27:49,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:49,456 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142 states and 171 transitions. [2025-02-08 14:27:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 171 transitions. [2025-02-08 14:27:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 77. [2025-02-08 14:27:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 69 states have internal predecessors, (85), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2025-02-08 14:27:49,465 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 92 transitions. [2025-02-08 14:27:49,465 INFO L432 stractBuchiCegarLoop]: Abstraction has 77 states and 92 transitions. [2025-02-08 14:27:49,465 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:27:49,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 92 transitions. [2025-02-08 14:27:49,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2025-02-08 14:27:49,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:49,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:49,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:49,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:49,466 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-08 14:27:49,466 INFO L754 eck$LassoCheckResult]: Loop: "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" [2025-02-08 14:27:49,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash 37359263, now seen corresponding path program 9 times [2025-02-08 14:27:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:49,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839689503] [2025-02-08 14:27:49,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:49,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:49,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-02-08 14:27:49,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:27:49,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:27:49,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:49,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:49,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:27:49,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:27:49,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:49,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:49,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:49,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash -20449328, now seen corresponding path program 4 times [2025-02-08 14:27:49,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:49,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964300866] [2025-02-08 14:27:49,513 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:27:49,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:49,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-02-08 14:27:49,517 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:49,517 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:27:49,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:49,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:49,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:49,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:49,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:49,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:49,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:49,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1421597554, now seen corresponding path program 10 times [2025-02-08 14:27:49,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748047309] [2025-02-08 14:27:49,521 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:27:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:49,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-08 14:27:49,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 14:27:49,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:27:49,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:49,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:49,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 14:27:49,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 14:27:49,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:49,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:49,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:51,115 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:51,116 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:51,116 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:51,116 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:51,116 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:51,116 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:51,116 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:51,116 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:51,116 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration11_Lasso [2025-02-08 14:27:51,116 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:51,116 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:51,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:51,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:51,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,080 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:52,080 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:52,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,082 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:52,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-08 14:27:52,085 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-02-08 14:27:52,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:52,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,106 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:52,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-08 14:27:52,108 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-02-08 14:27:52,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-08 14:27:52,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,126 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:52,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-08 14:27:52,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:52,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-08 14:27:52,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,147 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:52,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-08 14:27:52,148 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-02-08 14:27:52,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:52,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,167 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:52,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-08 14:27:52,169 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-02-08 14:27:52,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:52,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:52,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-08 14:27:52,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,192 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:52,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-08 14:27:52,193 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-02-08 14:27:52,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:52,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:52,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:52,311 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2025-02-08 14:27:52,311 INFO L444 ModelExtractionUtils]: 0 out of 31 variables were initially zero. Simplification set additionally 27 variables to zero. [2025-02-08 14:27:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,313 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:52,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-08 14:27:52,315 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:52,328 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:27:52,328 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:52,328 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_3, insertionSort_~i) = 1*v_rep(select #length insertionSort_~array.base)_3 - 2*insertionSort_~i Supporting invariants [1*insertionSort_~array.offset >= 0] [2025-02-08 14:27:52,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-08 14:27:52,348 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-02-08 14:27:52,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:27:52,351 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:27:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:52,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:27:52,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:27:52,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:52,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:52,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:27:52,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:52,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:52,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:52,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:52,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:52,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 14:27:52,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:52,636 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2025-02-08 14:27:52,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 92 transitions. cyclomatic complexity: 20 Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:52,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 92 transitions. cyclomatic complexity: 20. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 135 states and 165 transitions. Complement of second has 16 states. [2025-02-08 14:27:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 4 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2025-02-08 14:27:52,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 22 letters. Loop has 7 letters. [2025-02-08 14:27:52,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:52,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 29 letters. Loop has 7 letters. [2025-02-08 14:27:52,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:52,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 22 letters. Loop has 14 letters. [2025-02-08 14:27:52,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:52,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 165 transitions. [2025-02-08 14:27:52,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:27:52,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 90 states and 107 transitions. [2025-02-08 14:27:52,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-02-08 14:27:52,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:27:52,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 107 transitions. [2025-02-08 14:27:52,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:52,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 107 transitions. [2025-02-08 14:27:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 107 transitions. [2025-02-08 14:27:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2025-02-08 14:27:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 73 states have internal predecessors, (91), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2025-02-08 14:27:52,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 98 transitions. [2025-02-08 14:27:52,731 INFO L432 stractBuchiCegarLoop]: Abstraction has 81 states and 98 transitions. [2025-02-08 14:27:52,731 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:27:52,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 98 transitions. [2025-02-08 14:27:52,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-08 14:27:52,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:52,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:52,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:52,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:27:52,737 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~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~nondet9#1, main_#t~post10#1, main_~i~0#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet7#1;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;main_~i~0#1 := 0;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume main_~i~0#1 < main_~n~0#1;havoc main_#t~nondet9#1;call write~int#0(main_#t~nondet9#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1;" "assume !(main_~i~0#1 < main_~n~0#1);havoc main_~i~0#1;" "call insertionSort(0, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume !#t~short3;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume !#t~short3;havoc #t~mem2;havoc #t~short3;" "call write~int#0(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i;" "call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);"< "~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size;" "assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int#0(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i;" "assume true;#t~short3 := ~j~0 > 0;" [2025-02-08 14:27:52,738 INFO L754 eck$LassoCheckResult]: Loop: "assume #t~short3;call #t~mem2 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short3 := #t~mem2 > ~temp~0;" "assume #t~short3;havoc #t~mem2;havoc #t~short3;call #t~mem4 := read~int#0(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int#0(#t~mem4, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~post5 := ~j~0;~j~0 := #t~post5 - 1;havoc #t~post5;" "assume true;#t~short3 := ~j~0 > 0;" [2025-02-08 14:27:52,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1507963853, now seen corresponding path program 3 times [2025-02-08 14:27:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:52,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80675730] [2025-02-08 14:27:52,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:52,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-02-08 14:27:52,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:27:52,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:27:52,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:52,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:52,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:27:52,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:27:52,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:52,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:52,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:52,774 INFO L85 PathProgramCache]: Analyzing trace with hash 36713, now seen corresponding path program 3 times [2025-02-08 14:27:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380177701] [2025-02-08 14:27:52,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:52,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:52,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:52,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:27:52,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:52,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:52,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:52,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:52,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:52,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:52,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:52,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1606764515, now seen corresponding path program 11 times [2025-02-08 14:27:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395971134] [2025-02-08 14:27:52,782 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:27:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:52,788 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-02-08 14:27:52,835 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:52,835 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 14:27:52,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-08 14:27:52,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:52,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:52,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:52,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:52,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:52,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:54,271 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:54,272 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:54,272 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:54,272 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:54,272 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:54,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,272 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:54,272 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:54,272 INFO L132 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration12_Lasso [2025-02-08 14:27:54,272 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:54,272 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:54,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:54,812 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:54,812 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,814 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-02-08 14:27:54,816 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-02-08 14:27:54,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:54,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:54,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:54,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:54,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:54,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:54,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:54,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:54,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-02-08 14:27:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,835 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-02-08 14:27:54,838 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-02-08 14:27:54,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:54,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:54,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:54,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:54,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:54,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:54,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:54,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:54,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:54,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,857 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-02-08 14:27:54,859 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-02-08 14:27:54,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:54,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:54,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:54,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:54,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:54,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:54,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:54,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:54,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:54,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,878 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-02-08 14:27:54,880 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-02-08 14:27:54,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:54,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:54,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:54,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:54,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:54,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:54,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:54,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:54,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:54,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,898 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-02-08 14:27:54,901 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-02-08 14:27:54,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:54,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:54,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:54,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:54,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:54,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:54,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:54,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:54,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-02-08 14:27:54,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,920 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-02-08 14:27:54,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:54,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:54,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:54,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:54,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:54,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:54,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:54,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:54,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-02-08 14:27:54,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,942 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-02-08 14:27:54,944 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-02-08 14:27:54,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:54,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:54,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:54,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:54,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:54,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:54,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:54,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:54,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,972 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-02-08 14:27:54,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:54,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:54,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:54,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:54,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:54,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:54,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:54,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:54,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:54,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-08 14:27:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,993 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:54,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-02-08 14:27:54,995 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-02-08 14:27:55,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:55,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:55,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-02-08 14:27:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,018 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-02-08 14:27:55,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:55,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:55,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:55,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:55,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,039 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-02-08 14:27:55,041 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-02-08 14:27:55,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:55,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:55,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:55,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,060 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-02-08 14:27:55,061 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-02-08 14:27:55,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:55,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:55,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:55,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-08 14:27:55,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,080 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-02-08 14:27:55,082 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-02-08 14:27:55,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:55,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:55,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,103 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-02-08 14:27:55,105 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-02-08 14:27:55,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:55,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:55,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:55,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,123 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-02-08 14:27:55,126 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-02-08 14:27:55,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:55,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:55,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:55,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,146 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-02-08 14:27:55,147 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-02-08 14:27:55,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,157 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-08 14:27:55,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,160 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-08 14:27:55,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:55,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,172 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-02-08 14:27:55,174 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-02-08 14:27:55,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:55,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:55,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,196 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-02-08 14:27:55,198 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-02-08 14:27:55,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:55,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:55,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,220 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-02-08 14:27:55,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:55,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:55,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:55,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:55,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:55,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,256 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-02-08 14:27:55,259 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-02-08 14:27:55,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:55,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:55,269 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:27:55,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:55,276 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-08 14:27:55,276 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-08 14:27:55,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:55,329 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-02-08 14:27:55,329 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-02-08 14:27:55,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:55,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,332 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-08 14:27:55,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-02-08 14:27:55,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:55,346 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-02-08 14:27:55,346 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:55,346 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~array.offset, insertionSort_~j~0) = 1*insertionSort_~array.offset + 4*insertionSort_~j~0 Supporting invariants [] [2025-02-08 14:27:55,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-02-08 14:27:55,358 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2025-02-08 14:27:55,359 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~array!offset [2025-02-08 14:27:55,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:55,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:27:55,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:27:55,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:55,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:55,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:27:55,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:55,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:55,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:55,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:55,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:55,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:27:55,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:55,448 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-02-08 14:27:55,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 98 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:55,452 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 98 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 101 transitions. Complement of second has 6 states. [2025-02-08 14:27:55,452 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-02-08 14:27:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-02-08 14:27:55,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 24 letters. Loop has 3 letters. [2025-02-08 14:27:55,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:55,452 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:27:55,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:55,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:27:55,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:27:55,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:55,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:55,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:27:55,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:55,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:55,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:55,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:55,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:55,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:27:55,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:55,540 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-02-08 14:27:55,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 98 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:55,544 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 98 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 101 transitions. Complement of second has 6 states. [2025-02-08 14:27:55,545 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-02-08 14:27:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-02-08 14:27:55,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 24 letters. Loop has 3 letters. [2025-02-08 14:27:55,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:55,546 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:27:55,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:55,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 14:27:55,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 14:27:55,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:55,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:55,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:27:55,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:55,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:55,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:55,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:55,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:55,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:27:55,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:55,659 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-02-08 14:27:55,660 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81 states and 98 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:55,675 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81 states and 98 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 132 states and 162 transitions. Complement of second has 9 states. [2025-02-08 14:27:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:27:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-02-08 14:27:55,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2025-02-08 14:27:55,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:55,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2025-02-08 14:27:55,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:55,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2025-02-08 14:27:55,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:55,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 162 transitions. [2025-02-08 14:27:55,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:27:55,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 0 states and 0 transitions. [2025-02-08 14:27:55,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-08 14:27:55,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-08 14:27:55,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-08 14:27:55,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:55,680 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:27:55,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:27:55,680 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 14:27:55,680 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:27:55,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-08 14:27:55,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-08 14:27:55,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-08 14:27:55,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.02 02:27:55 BoogieIcfgContainer [2025-02-08 14:27:55,689 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-08 14:27:55,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:27:55,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:27:55,694 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:27:55,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:27:37" (3/4) ... [2025-02-08 14:27:55,695 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 14:27:55,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:27:55,696 INFO L158 Benchmark]: Toolchain (without parser) took 18574.10ms. Allocated memory was 201.3MB in the beginning and 553.6MB in the end (delta: 352.3MB). Free memory was 159.5MB in the beginning and 390.4MB in the end (delta: -230.9MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB. [2025-02-08 14:27:55,697 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 218.1MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:27:55,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.14ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 148.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:27:55,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.77ms. Allocated memory is still 201.3MB. Free memory was 148.9MB in the beginning and 148.0MB in the end (delta: 947.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:27:55,697 INFO L158 Benchmark]: Boogie Preprocessor took 24.33ms. Allocated memory is still 201.3MB. Free memory was 148.0MB in the beginning and 146.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:27:55,697 INFO L158 Benchmark]: IcfgBuilder took 222.74ms. Allocated memory is still 201.3MB. Free memory was 146.7MB in the beginning and 134.0MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 14:27:55,701 INFO L158 Benchmark]: BuchiAutomizer took 18138.94ms. Allocated memory was 201.3MB in the beginning and 553.6MB in the end (delta: 352.3MB). Free memory was 134.0MB in the beginning and 390.5MB in the end (delta: -256.5MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. [2025-02-08 14:27:55,702 INFO L158 Benchmark]: Witness Printer took 6.09ms. Allocated memory is still 553.6MB. Free memory was 390.5MB in the beginning and 390.4MB in the end (delta: 111.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:27:55,702 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.20ms. Allocated memory is still 218.1MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.14ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 148.9MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.77ms. Allocated memory is still 201.3MB. Free memory was 148.9MB in the beginning and 148.0MB in the end (delta: 947.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.33ms. Allocated memory is still 201.3MB. Free memory was 148.0MB in the beginning and 146.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 222.74ms. Allocated memory is still 201.3MB. Free memory was 146.7MB in the beginning and 134.0MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 18138.94ms. Allocated memory was 201.3MB in the beginning and 553.6MB in the end (delta: 352.3MB). Free memory was 134.0MB in the beginning and 390.5MB in the end (delta: -256.5MB). Peak memory consumption was 94.3MB. Max. memory is 16.1GB. * Witness Printer took 6.09ms. Allocated memory is still 553.6MB. Free memory was 390.5MB in the beginning and 390.4MB in the end (delta: 111.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~array!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function ((__int128) 18446744073709551609U + ((long) -4 * i)) and consists of 2 locations. One deterministic module has affine ranking function (size + ((long) -1 * j)) and consists of 7 locations. One deterministic module has affine ranking function (3 + ((long) -2 * i)) and consists of 13 locations. One deterministic module has affine ranking function null and consists of 9 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.1s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 15.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 115 StatesRemovedByMinimization, 7 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 [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/9 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 630 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 479 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 781 IncrementalHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 151 mSDtfsCounter, 781 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU1 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp97 ukn90 mio100 lsp47 div117 bol100 ite100 ukn100 eq195 hnf88 smp93 dnf118 smp91 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 91ms VariablesStem: 5 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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-02-08 14:27:55,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:56,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 14:27:56,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:56,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:56,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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