./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/mergeSort.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/mergeSort.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 e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:27:35,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:27:36,014 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:36,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:27:36,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:27:36,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:27:36,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:27:36,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:27:36,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:27:36,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:27:36,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:27:36,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:27:36,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:27:36,052 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:27:36,052 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:27:36,052 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:27:36,052 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:27:36,052 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:27:36,052 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:27:36,052 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:27:36,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:27:36,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:27:36,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:27:36,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:27:36,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:27:36,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:27:36,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:27:36,055 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:27:36,055 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 -> e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4 [2025-02-08 14:27:36,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:27:36,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:27:36,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:27:36,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:27:36,289 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:27:36,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2025-02-08 14:27:37,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c6be054/7091c8da11b14c459f9494ecdc1cc43d/FLAG02b43d823 [2025-02-08 14:27:37,749 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:27:37,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2025-02-08 14:27:37,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c6be054/7091c8da11b14c459f9494ecdc1cc43d/FLAG02b43d823 [2025-02-08 14:27:38,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c6be054/7091c8da11b14c459f9494ecdc1cc43d [2025-02-08 14:27:38,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:27:38,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:27:38,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:27:38,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:27:38,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:27:38,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:27:38" (1/1) ... [2025-02-08 14:27:38,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a01903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:38, skipping insertion in model container [2025-02-08 14:27:38,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:27:38" (1/1) ... [2025-02-08 14:27:38,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:27:38,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:27:38,230 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:27:38,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:27:38,252 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:27:38,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:38 WrapperNode [2025-02-08 14:27:38,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:27:38,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:27:38,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:27:38,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:27:38,257 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:38" (1/1) ... [2025-02-08 14:27:38,261 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:38" (1/1) ... [2025-02-08 14:27:38,271 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2025-02-08 14:27:38,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:27:38,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:27:38,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:27:38,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:27:38,277 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:38" (1/1) ... [2025-02-08 14:27:38,277 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:38" (1/1) ... [2025-02-08 14:27:38,278 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:38" (1/1) ... [2025-02-08 14:27:38,285 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [8, 2]. 80 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2025-02-08 14:27:38,286 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:38" (1/1) ... [2025-02-08 14:27:38,286 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:38" (1/1) ... [2025-02-08 14:27:38,289 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:38" (1/1) ... [2025-02-08 14:27:38,289 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:38" (1/1) ... [2025-02-08 14:27:38,290 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:38" (1/1) ... [2025-02-08 14:27:38,290 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:38" (1/1) ... [2025-02-08 14:27:38,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:27:38,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:27:38,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:27:38,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:27:38,292 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:38" (1/1) ... [2025-02-08 14:27:38,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:38,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:38,318 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:38,320 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:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:27:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:27:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2025-02-08 14:27:38,335 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2025-02-08 14:27:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:27:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:27:38,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:27:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:27:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:27:38,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:27:38,396 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:27:38,405 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:27:38,608 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-08 14:27:38,608 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:27:38,615 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:27:38,615 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:27:38,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:27:38 BoogieIcfgContainer [2025-02-08 14:27:38,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:27:38,616 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:27:38,616 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:27:38,620 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:27:38,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:38,620 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:27:38" (1/3) ... [2025-02-08 14:27:38,621 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf5de15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:27:38, skipping insertion in model container [2025-02-08 14:27:38,621 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:38,621 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:27:38" (2/3) ... [2025-02-08 14:27:38,622 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf5de15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:27:38, skipping insertion in model container [2025-02-08 14:27:38,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:27:38,622 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:27:38" (3/3) ... [2025-02-08 14:27:38,622 INFO L363 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2025-02-08 14:27:38,651 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:27:38,651 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:27:38,651 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:27:38,651 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:27:38,651 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:27:38,651 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:27:38,651 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:27:38,652 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:27:38,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 14:27:38,665 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-02-08 14:27:38,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:38,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:38,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:27:38,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:27:38,668 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:27:38,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 14:27:38,669 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-02-08 14:27:38,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:38,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:38,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-08 14:27:38,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:27:38,674 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" [2025-02-08 14:27:38,674 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" [2025-02-08 14:27:38,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1952, now seen corresponding path program 1 times [2025-02-08 14:27:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:38,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761304590] [2025-02-08 14:27:38,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:38,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:38,739 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,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:38,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:38,744 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,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:38,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2025-02-08 14:27:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:38,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337498067] [2025-02-08 14:27:38,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:38,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:38,766 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,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:38,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:38,770 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,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:38,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash 60537, now seen corresponding path program 1 times [2025-02-08 14:27:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:38,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249616406] [2025-02-08 14:27:38,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:38,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:38,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:38,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:38,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:38,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:38,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:38,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:38,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:38,990 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:38,991 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:38,991 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:38,991 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:38,991 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:38,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:38,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:38,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:38,992 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2025-02-08 14:27:38,995 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:38,995 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:39,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:39,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:39,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:39,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:39,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:39,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:39,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:39,300 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:39,317 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:39,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:39,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,322 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:39,323 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:39,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:39,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:39,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:39,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:39,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:39,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:39,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:39,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:39,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-08 14:27:39,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:39,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,381 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:39,382 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:39,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:39,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:39,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:39,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:39,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:39,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:39,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:39,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:39,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-08 14:27:39,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:39,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,407 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:39,408 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:39,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:39,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:39,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:39,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:39,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:39,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:39,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:39,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:39,428 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:39,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:39,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,432 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:39,433 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:39,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:39,445 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-08 14:27:39,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:39,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:39,447 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-08 14:27:39,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:39,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:39,457 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:39,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:39,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,460 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:39,460 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:39,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:39,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:39,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:39,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:39,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:39,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:39,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:39,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:39,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:39,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,485 INFO L229 MonitoredProcess]: Starting monitored process 7 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:39,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-08 14:27:39,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:39,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:39,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:39,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:39,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:39,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:39,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:39,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:39,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:39,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,522 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:39,523 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:39,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:39,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:39,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:39,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:39,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:39,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:39,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:39,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:39,563 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-08 14:27:39,565 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-02-08 14:27:39,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:39,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:39,568 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:39,572 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:39,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:39,584 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:27:39,584 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:39,585 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~a~0#1.offset >= 0] [2025-02-08 14:27:39,591 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:39,597 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-02-08 14:27:39,602 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:27:39,602 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:27:39,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:27:39,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:27:39,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:39,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:27:39,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:39,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:39,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:39,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:39,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:27:39,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:39,644 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:39,660 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:39,661 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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:39,693 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). 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 24 states and 33 transitions. Complement of second has 3 states. [2025-02-08 14:27:39,695 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:39,697 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:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2025-02-08 14:27:39,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-08 14:27:39,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:39,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-08 14:27:39,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:39,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-08 14:27:39,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:39,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2025-02-08 14:27:39,703 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:27:39,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 29 transitions. [2025-02-08 14:27:39,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-02-08 14:27:39,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-08 14:27:39,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2025-02-08 14:27:39,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:39,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-02-08 14:27:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2025-02-08 14:27:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 14:27:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 14:27:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2025-02-08 14:27:39,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-02-08 14:27:39,722 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-02-08 14:27:39,722 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:27:39,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2025-02-08 14:27:39,723 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:27:39,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:39,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:39,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-08 14:27:39,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:27:39,724 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< [2025-02-08 14:27:39,724 INFO L754 eck$LassoCheckResult]: Loop: "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< [2025-02-08 14:27:39,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1876653, now seen corresponding path program 1 times [2025-02-08 14:27:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46183389] [2025-02-08 14:27:39,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:27:39,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:27:39,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:39,776 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:39,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:39,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46183389] [2025-02-08 14:27:39,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46183389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:39,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:39,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:27:39,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591109445] [2025-02-08 14:27:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:39,779 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:39,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash 49635, now seen corresponding path program 1 times [2025-02-08 14:27:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448669318] [2025-02-08 14:27:39,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:39,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:39,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:39,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:39,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:39,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:27:39,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:27:39,951 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 13 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:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:39,962 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2025-02-08 14:27:39,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2025-02-08 14:27:39,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:27:39,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2025-02-08 14:27:39,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-08 14:27:39,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-08 14:27:39,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2025-02-08 14:27:39,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:39,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-02-08 14:27:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2025-02-08 14:27:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-08 14:27:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 14:27:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2025-02-08 14:27:39,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-02-08 14:27:39,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:27:39,967 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2025-02-08 14:27:39,967 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:27:39,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2025-02-08 14:27:39,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:27:39,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:39,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:39,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-08 14:27:39,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:27:39,969 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< [2025-02-08 14:27:39,969 INFO L754 eck$LassoCheckResult]: Loop: "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< [2025-02-08 14:27:39,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 58176838, now seen corresponding path program 1 times [2025-02-08 14:27:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183061142] [2025-02-08 14:27:39,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:39,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:27:39,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:27:39,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:39,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:27:39,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:27:39,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:39,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:39,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash 49635, now seen corresponding path program 2 times [2025-02-08 14:27:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453908373] [2025-02-08 14:27:39,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:39,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:40,001 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:40,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:27:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:40,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:40,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:40,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:40,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:40,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:40,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:40,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2020586882, now seen corresponding path program 1 times [2025-02-08 14:27:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:40,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195487190] [2025-02-08 14:27:40,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:40,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:27:40,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:27:40,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:40,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195487190] [2025-02-08 14:27:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195487190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299122992] [2025-02-08 14:27:40,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:40,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:40,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:40,113 INFO L229 MonitoredProcess]: Starting monitored process 10 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:40,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 14:27:40,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:27:40,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:27:40,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:40,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:40,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:27:40,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:40,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:40,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-08 14:27:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299122992] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:40,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:40,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-08 14:27:40,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651597707] [2025-02-08 14:27:40,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:40,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:40,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:27:40,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:27:40,426 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 12 Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:40,459 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2025-02-08 14:27:40,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2025-02-08 14:27:40,460 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:27:40,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 29 transitions. [2025-02-08 14:27:40,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2025-02-08 14:27:40,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-02-08 14:27:40,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2025-02-08 14:27:40,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:27:40,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-02-08 14:27:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2025-02-08 14:27:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-08 14:27:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 14:27:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2025-02-08 14:27:40,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-02-08 14:27:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:27:40,463 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-02-08 14:27:40,463 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:27:40,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2025-02-08 14:27:40,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:27:40,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:40,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:40,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-02-08 14:27:40,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:27:40,465 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< [2025-02-08 14:27:40,465 INFO L754 eck$LassoCheckResult]: Loop: "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< [2025-02-08 14:27:40,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1803482573, now seen corresponding path program 2 times [2025-02-08 14:27:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:40,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579482177] [2025-02-08 14:27:40,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:40,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-02-08 14:27:40,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:27:40,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:40,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:40,477 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:40,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:27:40,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:27:40,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:40,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:40,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:40,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash 49635, now seen corresponding path program 3 times [2025-02-08 14:27:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:40,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569048730] [2025-02-08 14:27:40,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:40,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:40,495 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:40,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:27:40,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:40,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:40,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:40,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:40,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:40,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:40,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:40,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1803446423, now seen corresponding path program 2 times [2025-02-08 14:27:40,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:40,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625346882] [2025-02-08 14:27:40,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:40,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-02-08 14:27:40,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:27:40,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:40,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:40,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:40,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:27:40,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:27:40,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:40,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:40,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:40,995 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:40,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:40,996 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:40,996 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:40,996 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:40,996 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:40,996 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:40,996 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:40,996 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2025-02-08 14:27:40,996 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:40,996 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:40,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:41,407 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:41,407 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:41,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,410 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,411 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,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,439 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,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,441 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,443 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,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,464 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,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,466 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,468 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,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-08 14:27:41,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,495 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,496 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,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,518 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:41,519 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:41,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,544 INFO L229 MonitoredProcess]: Starting monitored process 16 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,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-08 14:27:41,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:41,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,566 INFO L229 MonitoredProcess]: Starting monitored process 17 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,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-08 14:27:41,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-08 14:27:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,587 INFO L229 MonitoredProcess]: Starting monitored process 18 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,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-08 14:27:41,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-08 14:27:41,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,608 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:41,609 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:41,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-08 14:27:41,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,630 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:41,631 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:41,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:41,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-08 14:27:41,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,652 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:41,653 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:41,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,676 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:41,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,678 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:41,679 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:41,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,702 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:41,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,704 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:41,705 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:41,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:41,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:41,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-08 14:27:41,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,744 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:41,746 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:41,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,775 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:41,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,780 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:41,782 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:41,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:41,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,819 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:41,826 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:41,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:41,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-08 14:27:41,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,852 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:41,853 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:41,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,870 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:41,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,874 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:41,877 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:41,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,899 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:41,901 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: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,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,922 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:41,923 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:41,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,941 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:41,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,944 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:41,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,964 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:41,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:41,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:41,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:41,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:41,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:41,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:41,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:41,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:41,989 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:41,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:41,994 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:42,002 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:42,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:42,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:42,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:42,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:42,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:42,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:42,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:42,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:42,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-02-08 14:27:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:42,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,028 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:42,028 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:42,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:42,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:42,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:42,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:42,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:42,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:42,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:42,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:42,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-02-08 14:27:42,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:42,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,057 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:42,059 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:42,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:42,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:42,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:42,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:42,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:42,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:42,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:42,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:42,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:42,086 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:42,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:42,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,088 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:42,095 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:42,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:42,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:42,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:42,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:42,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:42,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:42,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:42,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:42,121 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:42,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:42,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,124 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:42,128 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:42,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:42,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:42,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:42,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:42,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:42,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:42,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:42,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:42,153 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:42,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:42,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,155 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:42,156 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:42,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:42,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:42,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:42,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:42,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:42,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:42,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:42,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:42,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:42,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,178 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:42,179 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:42,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:42,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:42,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:42,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:42,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:42,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:42,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:42,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:42,221 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-08 14:27:42,221 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-02-08 14:27:42,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:42,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,223 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:42,226 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:42,226 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:42,238 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:27:42,238 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:42,238 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2025-02-08 14:27:42,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:42,247 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-02-08 14:27:42,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:27:42,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:27:42,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:27:42,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:42,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:42,286 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,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:27:42,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:42,310 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,310 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:42,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:42,346 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Result 39 states and 51 transitions. Complement of second has 16 states. [2025-02-08 14:27:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2025-02-08 14:27:42,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-08 14:27:42,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:42,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 9 letters. Loop has 3 letters. [2025-02-08 14:27:42,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:42,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 6 letters. [2025-02-08 14:27:42,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:42,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2025-02-08 14:27:42,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:27:42,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 42 transitions. [2025-02-08 14:27:42,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-02-08 14:27:42,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-08 14:27:42,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 42 transitions. [2025-02-08 14:27:42,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:42,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2025-02-08 14:27:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 42 transitions. [2025-02-08 14:27:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-02-08 14:27:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 14:27:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2025-02-08 14:27:42,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-02-08 14:27:42,352 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2025-02-08 14:27:42,352 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:27:42,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2025-02-08 14:27:42,352 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-08 14:27:42,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:42,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:42,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:42,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:42,353 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" [2025-02-08 14:27:42,353 INFO L754 eck$LassoCheckResult]: Loop: "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" [2025-02-08 14:27:42,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1046716163, now seen corresponding path program 1 times [2025-02-08 14:27:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905949223] [2025-02-08 14:27:42,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:42,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:27:42,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:27:42,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:42,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:27:42,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:27:42,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:42,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1017806128, now seen corresponding path program 1 times [2025-02-08 14:27:42,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:42,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888419354] [2025-02-08 14:27:42,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:42,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:42,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:27:42,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:27:42,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:42,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:27:42,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:27:42,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:42,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:42,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 294124082, now seen corresponding path program 1 times [2025-02-08 14:27:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:42,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130809625] [2025-02-08 14:27:42,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:42,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:42,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:27:42,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:42,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:27:42,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:42,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130809625] [2025-02-08 14:27:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130809625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:42,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408412437] [2025-02-08 14:27:42,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:42,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:42,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:42,599 INFO L229 MonitoredProcess]: Starting monitored process 40 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,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-02-08 14:27:42,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:27:42,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:42,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:42,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:42,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:27:42,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:42,695 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:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:42,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:27:42,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408412437] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:42,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:42,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2025-02-08 14:27:42,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475444966] [2025-02-08 14:27:42,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:43,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 14:27:43,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-08 14:27:43,495 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 15 Second operand has 14 states, 10 states have (on average 1.9) internal successors, (19), 12 states have internal predecessors, (19), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 14:27:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:43,587 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2025-02-08 14:27:43,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 69 transitions. [2025-02-08 14:27:43,589 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-02-08 14:27:43,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 51 states and 66 transitions. [2025-02-08 14:27:43,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-02-08 14:27:43,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-02-08 14:27:43,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2025-02-08 14:27:43,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:43,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2025-02-08 14:27:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2025-02-08 14:27:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 14:27:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 14:27:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2025-02-08 14:27:43,598 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2025-02-08 14:27:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:27:43,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2025-02-08 14:27:43,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:27:43,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2025-02-08 14:27:43,599 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-02-08 14:27:43,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:43,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:43,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:43,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:43,600 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" [2025-02-08 14:27:43,600 INFO L754 eck$LassoCheckResult]: Loop: "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" [2025-02-08 14:27:43,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash -79599478, now seen corresponding path program 2 times [2025-02-08 14:27:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:43,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301973051] [2025-02-08 14:27:43,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:43,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-08 14:27:43,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:27:43,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:43,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:43,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:27:43,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:27:43,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:43,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:43,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1017806128, now seen corresponding path program 2 times [2025-02-08 14:27:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:43,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729070887] [2025-02-08 14:27:43,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:43,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:43,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-08 14:27:43,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:27:43,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:43,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:43,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:27:43,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:27:43,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:43,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:43,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:43,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1935455047, now seen corresponding path program 2 times [2025-02-08 14:27:43,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:43,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039085077] [2025-02-08 14:27:43,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:43,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:43,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-08 14:27:43,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:27:43,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:43,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:43,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:27:43,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:27:43,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:43,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:43,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:44,623 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:44,623 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:44,623 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:44,623 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:44,623 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:44,623 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:44,623 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:44,623 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:44,623 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2025-02-08 14:27:44,624 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:44,624 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:44,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:44,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:45,104 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:45,104 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:45,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,106 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:45,110 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:45,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:45,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,132 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:45,132 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:45,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,151 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:45,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,153 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:45,154 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:45,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,167 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-02-08 14:27:45,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,175 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:45,176 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:45,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,196 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:45,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,198 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:45,199 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:45,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,219 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:45,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,221 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:45,223 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:45,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-02-08 14:27:45,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,242 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:45,242 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:45,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,262 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:45,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,264 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:45,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,266 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:45,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-02-08 14:27:45,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,286 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:45,287 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:45,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,308 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:45,309 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:45,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,327 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:45,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,329 INFO L229 MonitoredProcess]: Starting monitored process 51 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:45,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-02-08 14:27:45,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-02-08 14:27:45,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,356 INFO L229 MonitoredProcess]: Starting monitored process 52 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:45,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-02-08 14:27:45,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-02-08 14:27:45,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,377 INFO L229 MonitoredProcess]: Starting monitored process 53 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:45,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-02-08 14:27:45,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,400 INFO L229 MonitoredProcess]: Starting monitored process 54 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:45,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-02-08 14:27:45,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,414 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,424 INFO L229 MonitoredProcess]: Starting monitored process 55 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:45,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-02-08 14:27:45,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-02-08 14:27:45,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,444 INFO L229 MonitoredProcess]: Starting monitored process 56 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:45,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-02-08 14:27:45,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,482 INFO L229 MonitoredProcess]: Starting monitored process 57 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:45,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-02-08 14:27:45,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,504 INFO L229 MonitoredProcess]: Starting monitored process 58 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:45,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-02-08 14:27:45,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:45,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,526 INFO L229 MonitoredProcess]: Starting monitored process 59 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:45,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-02-08 14:27:45,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:45,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,546 INFO L229 MonitoredProcess]: Starting monitored process 60 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:45,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-02-08 14:27:45,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,567 INFO L229 MonitoredProcess]: Starting monitored process 61 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:45,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-02-08 14:27:45,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:45,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,581 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-02-08 14:27:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,588 INFO L229 MonitoredProcess]: Starting monitored process 62 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:45,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-02-08 14:27:45,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,609 INFO L229 MonitoredProcess]: Starting monitored process 63 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:45,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-02-08 14:27:45,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,632 INFO L229 MonitoredProcess]: Starting monitored process 64 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:45,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-02-08 14:27:45,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-02-08 14:27:45,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,654 INFO L229 MonitoredProcess]: Starting monitored process 65 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:45,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-02-08 14:27:45,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-02-08 14:27:45,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,677 INFO L229 MonitoredProcess]: Starting monitored process 66 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:45,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-02-08 14:27:45,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-02-08 14:27:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,701 INFO L229 MonitoredProcess]: Starting monitored process 67 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:45,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-02-08 14:27:45,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-02-08 14:27:45,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,722 INFO L229 MonitoredProcess]: Starting monitored process 68 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:45,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-02-08 14:27:45,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,744 INFO L229 MonitoredProcess]: Starting monitored process 69 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:45,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-02-08 14:27:45,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,766 INFO L229 MonitoredProcess]: Starting monitored process 70 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:45,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-02-08 14:27:45,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,787 INFO L229 MonitoredProcess]: Starting monitored process 71 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:45,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-02-08 14:27:45,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,810 INFO L229 MonitoredProcess]: Starting monitored process 72 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:45,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-02-08 14:27:45,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,833 INFO L229 MonitoredProcess]: Starting monitored process 73 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:45,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-02-08 14:27:45,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-02-08 14:27:45,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,854 INFO L229 MonitoredProcess]: Starting monitored process 74 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:45,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-02-08 14:27:45,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,877 INFO L229 MonitoredProcess]: Starting monitored process 75 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:45,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-02-08 14:27:45,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:45,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-02-08 14:27:45,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,899 INFO L229 MonitoredProcess]: Starting monitored process 76 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:45,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-02-08 14:27:45,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:45,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,920 INFO L229 MonitoredProcess]: Starting monitored process 77 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:45,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-02-08 14:27:45,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:45,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,942 INFO L229 MonitoredProcess]: Starting monitored process 78 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:45,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-02-08 14:27:45,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:45,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:45,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:45,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:45,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-02-08 14:27:45,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,963 INFO L229 MonitoredProcess]: Starting monitored process 79 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:45,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-02-08 14:27:45,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:45,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:45,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:45,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:45,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:45,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:45,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:45,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:45,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-02-08 14:27:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:45,987 INFO L229 MonitoredProcess]: Starting monitored process 80 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:45,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-02-08 14:27:45,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:46,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:46,000 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-08 14:27:46,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:46,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:46,006 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-08 14:27:46,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:46,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:46,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:46,018 INFO L229 MonitoredProcess]: Starting monitored process 81 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:46,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-02-08 14:27:46,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:46,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:46,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:46,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:46,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:46,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:46,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:46,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:46,081 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-02-08 14:27:46,081 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2025-02-08 14:27:46,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:46,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:46,083 INFO L229 MonitoredProcess]: Starting monitored process 82 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:46,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-02-08 14:27:46,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:46,096 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-02-08 14:27:46,096 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:46,096 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~n#1) = 1*merge_sort_~n#1 Supporting invariants [1*merge_sort_~m~0#1 >= 0, -1*merge_sort_~n#1 + 2*merge_sort_~m~0#1 + 1 >= 0] [2025-02-08 14:27:46,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:46,116 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2025-02-08 14:27:46,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:46,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:27:46,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:27:46,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:46,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:27:46,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:46,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:27:46,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:27:46,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:46,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:27:46,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:46,293 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2025-02-08 14:27:46,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 66 transitions. cyclomatic complexity: 22 Second operand has 8 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 14:27:46,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 66 transitions. cyclomatic complexity: 22. Second operand has 8 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 150 states and 209 transitions. Complement of second has 30 states. [2025-02-08 14:27:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 14:27:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2025-02-08 14:27:46,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 14 letters. Loop has 8 letters. [2025-02-08 14:27:46,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:46,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 22 letters. Loop has 8 letters. [2025-02-08 14:27:46,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:46,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 14 letters. Loop has 16 letters. [2025-02-08 14:27:46,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:46,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 209 transitions. [2025-02-08 14:27:46,479 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2025-02-08 14:27:46,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 137 states and 196 transitions. [2025-02-08 14:27:46,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-02-08 14:27:46,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2025-02-08 14:27:46,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 196 transitions. [2025-02-08 14:27:46,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:46,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 196 transitions. [2025-02-08 14:27:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 196 transitions. [2025-02-08 14:27:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2025-02-08 14:27:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 19 states have call successors, (21), 13 states have call predecessors, (21), 10 states have return successors, (20), 15 states have call predecessors, (20), 17 states have call successors, (20) [2025-02-08 14:27:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 174 transitions. [2025-02-08 14:27:46,492 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 174 transitions. [2025-02-08 14:27:46,492 INFO L432 stractBuchiCegarLoop]: Abstraction has 125 states and 174 transitions. [2025-02-08 14:27:46,492 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:27:46,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 174 transitions. [2025-02-08 14:27:46,493 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2025-02-08 14:27:46,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:46,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:46,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:46,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:27:46,494 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" [2025-02-08 14:27:46,494 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" [2025-02-08 14:27:46,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2132074661, now seen corresponding path program 1 times [2025-02-08 14:27:46,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:46,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927887678] [2025-02-08 14:27:46,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:46,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:27:46,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:27:46,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:46,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:27:46,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:27:46,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 41450, now seen corresponding path program 1 times [2025-02-08 14:27:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436726741] [2025-02-08 14:27:46,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:46,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:46,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:46,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:46,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:46,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:46,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:46,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1635103034, now seen corresponding path program 1 times [2025-02-08 14:27:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145519963] [2025-02-08 14:27:46,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:46,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:27:46,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:27:46,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:46,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 14:27:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145519963] [2025-02-08 14:27:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145519963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:27:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966097828] [2025-02-08 14:27:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:46,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:46,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:27:46,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:27:46,741 INFO L87 Difference]: Start difference. First operand 125 states and 174 transitions. cyclomatic complexity: 67 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:27:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:46,769 INFO L93 Difference]: Finished difference Result 161 states and 221 transitions. [2025-02-08 14:27:46,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 221 transitions. [2025-02-08 14:27:46,770 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 64 [2025-02-08 14:27:46,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 161 states and 221 transitions. [2025-02-08 14:27:46,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2025-02-08 14:27:46,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2025-02-08 14:27:46,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 221 transitions. [2025-02-08 14:27:46,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:46,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 161 states and 221 transitions. [2025-02-08 14:27:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 221 transitions. [2025-02-08 14:27:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2025-02-08 14:27:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 126 states have (on average 1.3412698412698412) internal successors, (169), 126 states have internal predecessors, (169), 19 states have call successors, (21), 13 states have call predecessors, (21), 10 states have return successors, (20), 15 states have call predecessors, (20), 17 states have call successors, (20) [2025-02-08 14:27:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 210 transitions. [2025-02-08 14:27:46,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155 states and 210 transitions. [2025-02-08 14:27:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:27:46,788 INFO L432 stractBuchiCegarLoop]: Abstraction has 155 states and 210 transitions. [2025-02-08 14:27:46,789 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:27:46,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 210 transitions. [2025-02-08 14:27:46,790 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 60 [2025-02-08 14:27:46,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:46,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:46,792 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:46,792 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:46,792 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" [2025-02-08 14:27:46,792 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" [2025-02-08 14:27:46,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2132074661, now seen corresponding path program 2 times [2025-02-08 14:27:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097130464] [2025-02-08 14:27:46,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:46,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-08 14:27:46,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:27:46,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:46,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,811 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:46,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:27:46,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:27:46,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:46,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash -167616506, now seen corresponding path program 1 times [2025-02-08 14:27:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870662242] [2025-02-08 14:27:46,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:46,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:46,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:46,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:46,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:46,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:46,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1410187550, now seen corresponding path program 1 times [2025-02-08 14:27:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721608399] [2025-02-08 14:27:46,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:46,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 14:27:46,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:27:46,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:46,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 14:27:46,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 14:27:46,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:46,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:46,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:48,105 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:48,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:48,105 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:48,105 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:48,105 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:48,105 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,105 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:48,105 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:48,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2025-02-08 14:27:48,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:48,106 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:48,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:48,911 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:48,912 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:48,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:48,914 INFO L229 MonitoredProcess]: Starting monitored process 83 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,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-02-08 14:27:48,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:48,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:48,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:48,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:48,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:48,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:48,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:48,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:48,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-02-08 14:27:48,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:48,938 INFO L229 MonitoredProcess]: Starting monitored process 84 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,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-02-08 14:27:48,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:48,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:48,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:48,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:48,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:48,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:48,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:48,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:48,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-02-08 14:27:48,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:48,958 INFO L229 MonitoredProcess]: Starting monitored process 85 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,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-02-08 14:27:48,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:48,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:48,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:48,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:48,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:48,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:48,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:48,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:48,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:48,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:48,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:48,979 INFO L229 MonitoredProcess]: Starting monitored process 86 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,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-02-08 14:27:48,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:48,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:48,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:48,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:48,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:48,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:48,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:49,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,002 INFO L229 MonitoredProcess]: Starting monitored process 87 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:49,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-02-08 14:27:49,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:49,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:49,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:49,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:49,015 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:49,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,023 INFO L229 MonitoredProcess]: Starting monitored process 88 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:49,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-02-08 14:27:49,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:49,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:49,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:49,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:49,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-02-08 14:27:49,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,043 INFO L229 MonitoredProcess]: Starting monitored process 89 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:49,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-02-08 14:27:49,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:49,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:49,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:49,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:49,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:49,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,064 INFO L229 MonitoredProcess]: Starting monitored process 90 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:49,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-02-08 14:27:49,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:49,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:49,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:49,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:49,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-02-08 14:27:49,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,086 INFO L229 MonitoredProcess]: Starting monitored process 91 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:49,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-02-08 14:27:49,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:49,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:49,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:49,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:49,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-02-08 14:27:49,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,106 INFO L229 MonitoredProcess]: Starting monitored process 92 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:49,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-02-08 14:27:49,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:49,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:49,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:49,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:49,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:49,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,127 INFO L229 MonitoredProcess]: Starting monitored process 93 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:49,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-02-08 14:27:49,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:49,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:49,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:49,143 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-02-08 14:27:49,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,153 INFO L229 MonitoredProcess]: Starting monitored process 94 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:49,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-02-08 14:27:49,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:49,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,165 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-02-08 14:27:49,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,168 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-08 14:27:49,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:49,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-02-08 14:27:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,182 INFO L229 MonitoredProcess]: Starting monitored process 95 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:49,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-02-08 14:27:49,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:49,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:49,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:49,198 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:49,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,205 INFO L229 MonitoredProcess]: Starting monitored process 96 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:49,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-02-08 14:27:49,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:49,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:49,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:49,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:49,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:49,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-02-08 14:27:49,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,229 INFO L229 MonitoredProcess]: Starting monitored process 97 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:49,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-02-08 14:27:49,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:49,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:49,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:49,242 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-02-08 14:27:49,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:49,286 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-02-08 14:27:49,287 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-02-08 14:27:49,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:49,830 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2025-02-08 14:27:49,830 INFO L444 ModelExtractionUtils]: 18 out of 100 variables were initially zero. Simplification set additionally 78 variables to zero. [2025-02-08 14:27:49,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:49,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:49,833 INFO L229 MonitoredProcess]: Starting monitored process 98 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:49,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-02-08 14:27:49,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:49,848 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-02-08 14:27:49,848 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:49,848 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_#in~a#1.base)_3, merge_sort_merge_~a#1.offset) = -4*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_#in~a#1.base)_3 - 1*merge_sort_merge_~a#1.offset Supporting invariants [] [2025-02-08 14:27:49,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:49,877 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-02-08 14:27:49,881 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:27:49,881 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:27:49,881 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2025-02-08 14:27:49,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:49,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:27:49,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:27:49,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:49,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:49,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 14:27:49,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:50,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:50,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:50,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:50,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 14:27:50,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:50,123 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:50,124 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2025-02-08 14:27:50,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 155 states and 210 transitions. cyclomatic complexity: 73 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:27:50,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:50,283 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 155 states and 210 transitions. cyclomatic complexity: 73. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 444 states and 627 transitions. Complement of second has 16 states. [2025-02-08 14:27:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:27:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2025-02-08 14:27:50,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 19 letters. Loop has 7 letters. [2025-02-08 14:27:50,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:50,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 26 letters. Loop has 7 letters. [2025-02-08 14:27:50,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:50,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 19 letters. Loop has 14 letters. [2025-02-08 14:27:50,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:50,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 444 states and 627 transitions. [2025-02-08 14:27:50,290 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 112 [2025-02-08 14:27:50,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 444 states to 444 states and 627 transitions. [2025-02-08 14:27:50,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2025-02-08 14:27:50,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2025-02-08 14:27:50,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 444 states and 627 transitions. [2025-02-08 14:27:50,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:50,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 444 states and 627 transitions. [2025-02-08 14:27:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states and 627 transitions. [2025-02-08 14:27:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 307. [2025-02-08 14:27:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 262 states have (on average 1.366412213740458) internal successors, (358), 261 states have internal predecessors, (358), 30 states have call successors, (33), 19 states have call predecessors, (33), 15 states have return successors, (42), 26 states have call predecessors, (42), 28 states have call successors, (42) [2025-02-08 14:27:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 433 transitions. [2025-02-08 14:27:50,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 307 states and 433 transitions. [2025-02-08 14:27:50,308 INFO L432 stractBuchiCegarLoop]: Abstraction has 307 states and 433 transitions. [2025-02-08 14:27:50,308 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:27:50,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 433 transitions. [2025-02-08 14:27:50,309 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 80 [2025-02-08 14:27:50,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:50,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:50,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:50,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:27:50,310 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" [2025-02-08 14:27:50,310 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" [2025-02-08 14:27:50,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1669805053, now seen corresponding path program 1 times [2025-02-08 14:27:50,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:50,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602634116] [2025-02-08 14:27:50,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:50,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:50,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:27:50,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:27:50,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 14:27:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602634116] [2025-02-08 14:27:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602634116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:50,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:50,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:27:50,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904409088] [2025-02-08 14:27:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:50,366 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:50,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:50,366 INFO L85 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2025-02-08 14:27:50,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:50,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116089708] [2025-02-08 14:27:50,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:50,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:50,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:50,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:50,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:50,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:50,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:50,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:50,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:27:50,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:27:50,480 INFO L87 Difference]: Start difference. First operand 307 states and 433 transitions. cyclomatic complexity: 158 Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:27:50,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:50,503 INFO L93 Difference]: Finished difference Result 447 states and 601 transitions. [2025-02-08 14:27:50,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 447 states and 601 transitions. [2025-02-08 14:27:50,509 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 80 [2025-02-08 14:27:50,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 447 states to 447 states and 601 transitions. [2025-02-08 14:27:50,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2025-02-08 14:27:50,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2025-02-08 14:27:50,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 447 states and 601 transitions. [2025-02-08 14:27:50,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:50,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 447 states and 601 transitions. [2025-02-08 14:27:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states and 601 transitions. [2025-02-08 14:27:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 312. [2025-02-08 14:27:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 267 states have (on average 1.3370786516853932) internal successors, (357), 266 states have internal predecessors, (357), 30 states have call successors, (33), 19 states have call predecessors, (33), 15 states have return successors, (42), 26 states have call predecessors, (42), 28 states have call successors, (42) [2025-02-08 14:27:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 432 transitions. [2025-02-08 14:27:50,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 312 states and 432 transitions. [2025-02-08 14:27:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:27:50,537 INFO L432 stractBuchiCegarLoop]: Abstraction has 312 states and 432 transitions. [2025-02-08 14:27:50,537 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:27:50,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 312 states and 432 transitions. [2025-02-08 14:27:50,538 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 80 [2025-02-08 14:27:50,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:50,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:50,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:50,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-02-08 14:27:50,539 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:27:50,539 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:27:50,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1669805063, now seen corresponding path program 1 times [2025-02-08 14:27:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839048045] [2025-02-08 14:27:50,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:50,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:50,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:27:50,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:27:50,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:50,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:27:50,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:27:50,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:50,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash 38971538, now seen corresponding path program 1 times [2025-02-08 14:27:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:50,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178873146] [2025-02-08 14:27:50,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:50,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:27:50,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:27:50,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:50,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:27:50,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:27:50,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:50,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2123823028, now seen corresponding path program 1 times [2025-02-08 14:27:50,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:50,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044657542] [2025-02-08 14:27:50,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:50,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 14:27:50,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 14:27:50,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 14:27:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044657542] [2025-02-08 14:27:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044657542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:27:50,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:27:50,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:27:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463724405] [2025-02-08 14:27:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:27:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:50,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:27:50,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:27:50,745 INFO L87 Difference]: Start difference. First operand 312 states and 432 transitions. cyclomatic complexity: 152 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:27:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:50,773 INFO L93 Difference]: Finished difference Result 408 states and 550 transitions. [2025-02-08 14:27:50,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 550 transitions. [2025-02-08 14:27:50,776 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 115 [2025-02-08 14:27:50,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 408 states and 550 transitions. [2025-02-08 14:27:50,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2025-02-08 14:27:50,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2025-02-08 14:27:50,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 408 states and 550 transitions. [2025-02-08 14:27:50,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:50,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 408 states and 550 transitions. [2025-02-08 14:27:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states and 550 transitions. [2025-02-08 14:27:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-02-08 14:27:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 363 states have (on average 1.3085399449035813) internal successors, (475), 362 states have internal predecessors, (475), 30 states have call successors, (33), 19 states have call predecessors, (33), 15 states have return successors, (42), 26 states have call predecessors, (42), 28 states have call successors, (42) [2025-02-08 14:27:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 550 transitions. [2025-02-08 14:27:50,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 408 states and 550 transitions. [2025-02-08 14:27:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:27:50,805 INFO L432 stractBuchiCegarLoop]: Abstraction has 408 states and 550 transitions. [2025-02-08 14:27:50,805 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:27:50,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 408 states and 550 transitions. [2025-02-08 14:27:50,811 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 115 [2025-02-08 14:27:50,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:50,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:50,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:50,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:50,811 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:27:50,811 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:27:50,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1669805063, now seen corresponding path program 2 times [2025-02-08 14:27:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624522883] [2025-02-08 14:27:50,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:50,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 14:27:50,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:27:50,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:27:50,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:50,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:27:50,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:27:50,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:50,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1085657937, now seen corresponding path program 1 times [2025-02-08 14:27:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041500006] [2025-02-08 14:27:50,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:50,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:50,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:50,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:50,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:50,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:50,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash -767064599, now seen corresponding path program 1 times [2025-02-08 14:27:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530739721] [2025-02-08 14:27:50,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:50,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:50,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:50,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:50,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:50,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:50,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:50,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:50,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:52,062 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:52,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:52,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:52,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:52,062 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:52,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:52,062 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:52,062 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration11_Lasso [2025-02-08 14:27:52,062 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:52,062 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:52,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:52,835 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:52,835 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:52,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,838 INFO L229 MonitoredProcess]: Starting monitored process 99 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,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-02-08 14:27:52,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:52,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,860 INFO L229 MonitoredProcess]: Starting monitored process 100 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,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-02-08 14:27:52,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,890 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-02-08 14:27:52,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,898 INFO L229 MonitoredProcess]: Starting monitored process 101 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,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-02-08 14:27:52,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:52,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,919 INFO L229 MonitoredProcess]: Starting monitored process 102 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,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-02-08 14:27:52,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:52,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:52,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,941 INFO L229 MonitoredProcess]: Starting monitored process 103 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,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-02-08 14:27:52,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:52,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-02-08 14:27:52,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,962 INFO L229 MonitoredProcess]: Starting monitored process 104 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,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-02-08 14:27:52,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:52,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-02-08 14:27:52,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:52,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:52,983 INFO L229 MonitoredProcess]: Starting monitored process 105 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,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-02-08 14:27:52,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:52,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:52,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:52,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:52,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:52,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:52,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:52,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:52,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-02-08 14:27:53,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,004 INFO L229 MonitoredProcess]: Starting monitored process 106 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:53,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-02-08 14:27:53,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:53,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-02-08 14:27:53,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,025 INFO L229 MonitoredProcess]: Starting monitored process 107 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:53,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-02-08 14:27:53,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,046 INFO L229 MonitoredProcess]: Starting monitored process 108 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:53,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-02-08 14:27:53,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-02-08 14:27:53,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,068 INFO L229 MonitoredProcess]: Starting monitored process 109 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:53,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-02-08 14:27:53,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:53,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,089 INFO L229 MonitoredProcess]: Starting monitored process 110 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:53,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-02-08 14:27:53,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-02-08 14:27:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,109 INFO L229 MonitoredProcess]: Starting monitored process 111 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:53,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-02-08 14:27:53,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-02-08 14:27:53,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,130 INFO L229 MonitoredProcess]: Starting monitored process 112 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:53,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-02-08 14:27:53,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,152 INFO L229 MonitoredProcess]: Starting monitored process 113 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:53,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-02-08 14:27:53,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-02-08 14:27:53,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,174 INFO L229 MonitoredProcess]: Starting monitored process 114 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:53,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-02-08 14:27:53,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,195 INFO L229 MonitoredProcess]: Starting monitored process 115 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:53,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-02-08 14:27:53,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,216 INFO L229 MonitoredProcess]: Starting monitored process 116 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:53,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-02-08 14:27:53,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,236 INFO L229 MonitoredProcess]: Starting monitored process 117 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:53,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-02-08 14:27:53,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-02-08 14:27:53,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,256 INFO L229 MonitoredProcess]: Starting monitored process 118 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:53,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-02-08 14:27:53,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:53,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,278 INFO L229 MonitoredProcess]: Starting monitored process 119 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:53,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-02-08 14:27:53,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-02-08 14:27:53,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,298 INFO L229 MonitoredProcess]: Starting monitored process 120 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:53,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-02-08 14:27:53,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,320 INFO L229 MonitoredProcess]: Starting monitored process 121 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:53,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-02-08 14:27:53,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,344 INFO L229 MonitoredProcess]: Starting monitored process 122 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:53,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-02-08 14:27:53,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-02-08 14:27:53,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,365 INFO L229 MonitoredProcess]: Starting monitored process 123 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:53,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-02-08 14:27:53,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,385 INFO L229 MonitoredProcess]: Starting monitored process 124 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:53,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-02-08 14:27:53,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,405 INFO L229 MonitoredProcess]: Starting monitored process 125 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:53,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-02-08 14:27:53,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:53,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:53,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:53,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2025-02-08 14:27:53,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,426 INFO L229 MonitoredProcess]: Starting monitored process 126 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:53,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-02-08 14:27:53,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:27:53,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:53,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:53,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:53,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:53,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:53,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:53,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:53,451 INFO L229 MonitoredProcess]: Starting monitored process 127 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:53,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-02-08 14:27:53,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:53,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:53,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:53,463 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-02-08 14:27:53,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:53,508 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-02-08 14:27:53,508 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-02-08 14:27:53,741 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:54,739 INFO L443 ModelExtractionUtils]: Simplification made 86 calls to the SMT solver. [2025-02-08 14:27:54,739 INFO L444 ModelExtractionUtils]: 11 out of 109 variables were initially zero. Simplification set additionally 95 variables to zero. [2025-02-08 14:27:54,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:54,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:54,741 INFO L229 MonitoredProcess]: Starting monitored process 128 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,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-02-08 14:27:54,743 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:54,757 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-02-08 14:27:54,757 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:54,757 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~k~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~k~0#1 + 1*merge_sort_merge_~n#1 Supporting invariants [] [2025-02-08 14:27:54,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:54,787 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-02-08 14:27:54,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:54,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:27:54,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:27:54,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:54,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:54,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:27:54,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:54,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:27:54,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:27:54,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:54,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:54,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:27:54,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:54,950 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:54,951 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-02-08 14:27:54,951 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 408 states and 550 transitions. cyclomatic complexity: 180 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:27:55,005 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 408 states and 550 transitions. cyclomatic complexity: 180. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 634 states and 852 transitions. Complement of second has 14 states. [2025-02-08 14:27:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-08 14:27:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:27:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2025-02-08 14:27:55,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2025-02-08 14:27:55,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:55,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 7 letters. [2025-02-08 14:27:55,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:55,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 14 letters. [2025-02-08 14:27:55,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:27:55,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 634 states and 852 transitions. [2025-02-08 14:27:55,017 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 67 [2025-02-08 14:27:55,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 634 states to 564 states and 775 transitions. [2025-02-08 14:27:55,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2025-02-08 14:27:55,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2025-02-08 14:27:55,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 775 transitions. [2025-02-08 14:27:55,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:55,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 564 states and 775 transitions. [2025-02-08 14:27:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 775 transitions. [2025-02-08 14:27:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 474. [2025-02-08 14:27:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 429 states have (on average 1.3682983682983683) internal successors, (587), 428 states have internal predecessors, (587), 30 states have call successors, (33), 19 states have call predecessors, (33), 15 states have return successors, (42), 26 states have call predecessors, (42), 28 states have call successors, (42) [2025-02-08 14:27:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 662 transitions. [2025-02-08 14:27:55,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 474 states and 662 transitions. [2025-02-08 14:27:55,036 INFO L432 stractBuchiCegarLoop]: Abstraction has 474 states and 662 transitions. [2025-02-08 14:27:55,036 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:27:55,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 474 states and 662 transitions. [2025-02-08 14:27:55,038 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 67 [2025-02-08 14:27:55,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:55,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:55,039 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:55,039 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:27:55,039 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< [2025-02-08 14:27:55,039 INFO L754 eck$LassoCheckResult]: Loop: "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< [2025-02-08 14:27:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2015776023, now seen corresponding path program 3 times [2025-02-08 14:27:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448453159] [2025-02-08 14:27:55,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:55,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-02-08 14:27:55,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:55,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 14:27:55,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:55,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448453159] [2025-02-08 14:27:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448453159] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700806846] [2025-02-08 14:27:55,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:55,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:55,352 INFO L229 MonitoredProcess]: Starting monitored process 129 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:55,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-02-08 14:27:55,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-02-08 14:27:55,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:27:55,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 14:27:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:55,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 14:27:55,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:55,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:27:55,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700806846] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:55,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2025-02-08 14:27:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720116644] [2025-02-08 14:27:55,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:55,646 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:55,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 49635, now seen corresponding path program 4 times [2025-02-08 14:27:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:55,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338000552] [2025-02-08 14:27:55,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:27:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:55,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-08 14:27:55,653 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:27:55,653 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:27:55,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:55,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:55,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:27:55,654 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,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:55,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:55,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:55,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:55,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 14:27:55,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-02-08 14:27:55,795 INFO L87 Difference]: Start difference. First operand 474 states and 662 transitions. cyclomatic complexity: 226 Second operand has 24 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 14:27:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:56,085 INFO L93 Difference]: Finished difference Result 746 states and 1029 transitions. [2025-02-08 14:27:56,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 746 states and 1029 transitions. [2025-02-08 14:27:56,090 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 121 [2025-02-08 14:27:56,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 746 states to 740 states and 1022 transitions. [2025-02-08 14:27:56,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 339 [2025-02-08 14:27:56,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 353 [2025-02-08 14:27:56,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 740 states and 1022 transitions. [2025-02-08 14:27:56,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:56,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 740 states and 1022 transitions. [2025-02-08 14:27:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states and 1022 transitions. [2025-02-08 14:27:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 694. [2025-02-08 14:27:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 623 states have (on average 1.3579454253611556) internal successors, (846), 621 states have internal predecessors, (846), 46 states have call successors, (52), 33 states have call predecessors, (52), 25 states have return successors, (60), 39 states have call predecessors, (60), 42 states have call successors, (60) [2025-02-08 14:27:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 958 transitions. [2025-02-08 14:27:56,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 694 states and 958 transitions. [2025-02-08 14:27:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 14:27:56,114 INFO L432 stractBuchiCegarLoop]: Abstraction has 694 states and 958 transitions. [2025-02-08 14:27:56,114 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-08 14:27:56,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 694 states and 958 transitions. [2025-02-08 14:27:56,117 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-08 14:27:56,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:56,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:56,117 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:56,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:27:56,118 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" [2025-02-08 14:27:56,118 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" [2025-02-08 14:27:56,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash -767064609, now seen corresponding path program 1 times [2025-02-08 14:27:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212495091] [2025-02-08 14:27:56,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:56,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:56,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:56,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:56,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 14:27:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:27:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212495091] [2025-02-08 14:27:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212495091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:27:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179485890] [2025-02-08 14:27:56,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:56,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:27:56,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:56,202 INFO L229 MonitoredProcess]: Starting monitored process 130 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:56,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2025-02-08 14:27:56,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 14:27:56,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 14:27:56,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:56,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:56,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:27:56,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:27:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 14:27:56,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:27:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 14:27:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179485890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:27:56,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:27:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 14:27:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473676949] [2025-02-08 14:27:56,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:27:56,343 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:27:56,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:56,343 INFO L85 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2025-02-08 14:27:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:56,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307381956] [2025-02-08 14:27:56,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:27:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:56,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:56,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:56,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:27:56,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:56,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:56,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:56,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:56,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:56,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:56,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:27:56,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 14:27:56,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:27:56,395 INFO L87 Difference]: Start difference. First operand 694 states and 958 transitions. cyclomatic complexity: 313 Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:27:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:27:56,436 INFO L93 Difference]: Finished difference Result 1358 states and 1760 transitions. [2025-02-08 14:27:56,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1358 states and 1760 transitions. [2025-02-08 14:27:56,445 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-08 14:27:56,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1358 states to 1294 states and 1688 transitions. [2025-02-08 14:27:56,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2025-02-08 14:27:56,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2025-02-08 14:27:56,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1294 states and 1688 transitions. [2025-02-08 14:27:56,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:27:56,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1294 states and 1688 transitions. [2025-02-08 14:27:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states and 1688 transitions. [2025-02-08 14:27:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 776. [2025-02-08 14:27:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 705 states have (on average 1.3078014184397162) internal successors, (922), 703 states have internal predecessors, (922), 46 states have call successors, (52), 33 states have call predecessors, (52), 25 states have return successors, (60), 39 states have call predecessors, (60), 42 states have call successors, (60) [2025-02-08 14:27:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1034 transitions. [2025-02-08 14:27:56,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 776 states and 1034 transitions. [2025-02-08 14:27:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:27:56,475 INFO L432 stractBuchiCegarLoop]: Abstraction has 776 states and 1034 transitions. [2025-02-08 14:27:56,475 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-08 14:27:56,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 776 states and 1034 transitions. [2025-02-08 14:27:56,478 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-08 14:27:56,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:27:56,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:27:56,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:27:56,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:27:56,481 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" [2025-02-08 14:27:56,481 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" [2025-02-08 14:27:56,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1899517146, now seen corresponding path program 1 times [2025-02-08 14:27:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151293702] [2025-02-08 14:27:56,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:56,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 14:27:56,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 14:27:56,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:56,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:56,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:56,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 14:27:56,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 14:27:56,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:56,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:56,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:56,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:56,521 INFO L85 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2025-02-08 14:27:56,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:56,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141632649] [2025-02-08 14:27:56,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:27:56,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:56,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:56,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:56,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:27:56,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:56,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:56,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:27:56,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:27:56,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:56,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:56,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1244510617, now seen corresponding path program 1 times [2025-02-08 14:27:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:27:56,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980569402] [2025-02-08 14:27:56,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:27:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:27:56,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:27:56,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:27:56,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:56,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:56,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:27:56,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:27:56,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:27:56,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:56,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:27:56,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:27:58,269 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:27:58,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:27:58,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:27:58,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:27:58,270 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:27:58,270 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:58,270 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:27:58,270 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:27:58,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration14_Lasso [2025-02-08 14:27:58,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:27:58,271 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:27:58,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:58,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:27:59,356 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:27:59,356 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:27:59,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:59,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:59,359 INFO L229 MonitoredProcess]: Starting monitored process 131 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:59,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-02-08 14:27:59,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:59,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:59,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:59,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:59,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:59,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:59,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:59,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:59,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:59,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:59,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:59,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:59,381 INFO L229 MonitoredProcess]: Starting monitored process 132 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:59,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-02-08 14:27:59,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:59,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:59,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:59,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:59,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:59,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:59,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:59,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:59,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-02-08 14:27:59,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:59,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:59,431 INFO L229 MonitoredProcess]: Starting monitored process 133 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:59,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-02-08 14:27:59,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:59,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:59,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:59,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:59,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:59,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:59,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:59,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:59,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-02-08 14:27:59,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:59,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:59,461 INFO L229 MonitoredProcess]: Starting monitored process 134 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:59,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-02-08 14:27:59,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:59,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:59,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:27:59,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:59,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:59,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:59,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:27:59,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:27:59,474 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:27:59,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:59,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:59,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:59,484 INFO L229 MonitoredProcess]: Starting monitored process 135 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:59,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-02-08 14:27:59,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:59,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:27:59,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:27:59,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:27:59,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:27:59,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:27:59,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:27:59,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:27:59,692 INFO L443 ModelExtractionUtils]: Simplification made 52 calls to the SMT solver. [2025-02-08 14:27:59,692 INFO L444 ModelExtractionUtils]: 7 out of 43 variables were initially zero. Simplification set additionally 32 variables to zero. [2025-02-08 14:27:59,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:27:59,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:27:59,695 INFO L229 MonitoredProcess]: Starting monitored process 136 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:59,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-02-08 14:27:59,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:27:59,708 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-08 14:27:59,708 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:27:59,708 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~a#1.base)_3, merge_sort_merge_~i~0#1) = 1*v_rep(select #length merge_sort_merge_~a#1.base)_3 - 4*merge_sort_merge_~i~0#1 Supporting invariants [1*merge_sort_merge_~a#1.offset >= 0] [2025-02-08 14:27:59,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2025-02-08 14:27:59,768 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-02-08 14:27:59,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:27:59,769 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:27:59,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:27:59,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 14:27:59,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 14:27:59,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:27:59,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:27:59,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 14:27:59,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:00,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:00,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:00,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:00,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:00,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:28:00,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:00,016 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:28:00,016 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 1 loop predicates [2025-02-08 14:28:00,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 776 states and 1034 transitions. cyclomatic complexity: 307 Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:28:00,201 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 776 states and 1034 transitions. cyclomatic complexity: 307. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1040 states and 1412 transitions. Complement of second has 15 states. [2025-02-08 14:28:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 6 stem states 0 non-accepting loop states 2 accepting loop states [2025-02-08 14:28:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:28:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2025-02-08 14:28:00,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 30 letters. Loop has 1 letters. [2025-02-08 14:28:00,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:00,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 31 letters. Loop has 1 letters. [2025-02-08 14:28:00,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:00,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 46 transitions. Stem has 30 letters. Loop has 2 letters. [2025-02-08 14:28:00,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:00,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1040 states and 1412 transitions. [2025-02-08 14:28:00,211 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-08 14:28:00,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1040 states to 878 states and 1193 transitions. [2025-02-08 14:28:00,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2025-02-08 14:28:00,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 429 [2025-02-08 14:28:00,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 878 states and 1193 transitions. [2025-02-08 14:28:00,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:00,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 878 states and 1193 transitions. [2025-02-08 14:28:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states and 1193 transitions. [2025-02-08 14:28:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 759. [2025-02-08 14:28:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 694 states have (on average 1.314121037463977) internal successors, (912), 692 states have internal predecessors, (912), 44 states have call successors, (48), 28 states have call predecessors, (48), 21 states have return successors, (58), 38 states have call predecessors, (58), 41 states have call successors, (58) [2025-02-08 14:28:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1018 transitions. [2025-02-08 14:28:00,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 759 states and 1018 transitions. [2025-02-08 14:28:00,235 INFO L432 stractBuchiCegarLoop]: Abstraction has 759 states and 1018 transitions. [2025-02-08 14:28:00,235 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-08 14:28:00,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 759 states and 1018 transitions. [2025-02-08 14:28:00,238 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-08 14:28:00,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:00,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:00,239 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:00,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:28:00,239 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" [2025-02-08 14:28:00,239 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" [2025-02-08 14:28:00,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash -564196892, now seen corresponding path program 2 times [2025-02-08 14:28:00,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:00,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70705432] [2025-02-08 14:28:00,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:00,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 14:28:00,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:28:00,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:00,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:00,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:00,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 14:28:00,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:28:00,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:00,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:00,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:00,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2025-02-08 14:28:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:00,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627167623] [2025-02-08 14:28:00,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:00,277 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-08 14:28:00,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:00,302 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:00,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:00,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:00,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:00,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:00,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:00,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:00,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:00,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash -310234467, now seen corresponding path program 2 times [2025-02-08 14:28:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976004779] [2025-02-08 14:28:00,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:00,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-02-08 14:28:00,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-08 14:28:00,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:28:00,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:00,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:00,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:00,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 14:28:00,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 14:28:00,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:00,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:00,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:03,199 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:28:03,199 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:28:03,199 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:28:03,199 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:28:03,199 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:28:03,199 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:03,199 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:28:03,199 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:28:03,199 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration15_Lasso [2025-02-08 14:28:03,199 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:28:03,199 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:28:03,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:03,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:04,475 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:28:04,475 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:28:04,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,477 INFO L229 MonitoredProcess]: Starting monitored process 137 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:28:04,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-02-08 14:28:04,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,505 INFO L229 MonitoredProcess]: Starting monitored process 138 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:28:04,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-02-08 14:28:04,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,529 INFO L229 MonitoredProcess]: Starting monitored process 139 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:28:04,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-02-08 14:28:04,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:04,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,556 INFO L229 MonitoredProcess]: Starting monitored process 140 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:28:04,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-02-08 14:28:04,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:04,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,577 INFO L229 MonitoredProcess]: Starting monitored process 141 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:28:04,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-02-08 14:28:04,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,598 INFO L229 MonitoredProcess]: Starting monitored process 142 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:28:04,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-02-08 14:28:04,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,619 INFO L229 MonitoredProcess]: Starting monitored process 143 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:28:04,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-02-08 14:28:04,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-02-08 14:28:04,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,640 INFO L229 MonitoredProcess]: Starting monitored process 144 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:28:04,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-02-08 14:28:04,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-02-08 14:28:04,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,661 INFO L229 MonitoredProcess]: Starting monitored process 145 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:28:04,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-02-08 14:28:04,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,673 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-02-08 14:28:04,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,682 INFO L229 MonitoredProcess]: Starting monitored process 146 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:28:04,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-02-08 14:28:04,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,707 INFO L229 MonitoredProcess]: Starting monitored process 147 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:28:04,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-02-08 14:28:04,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,729 INFO L229 MonitoredProcess]: Starting monitored process 148 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:28:04,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-02-08 14:28:04,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-02-08 14:28:04,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,749 INFO L229 MonitoredProcess]: Starting monitored process 149 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:28:04,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-02-08 14:28:04,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-02-08 14:28:04,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,771 INFO L229 MonitoredProcess]: Starting monitored process 150 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:28:04,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-02-08 14:28:04,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:04,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-02-08 14:28:04,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,801 INFO L229 MonitoredProcess]: Starting monitored process 151 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:28:04,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-02-08 14:28:04,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,824 INFO L229 MonitoredProcess]: Starting monitored process 152 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:28:04,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-02-08 14:28:04,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-02-08 14:28:04,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,845 INFO L229 MonitoredProcess]: Starting monitored process 153 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:28:04,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-02-08 14:28:04,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-02-08 14:28:04,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,873 INFO L229 MonitoredProcess]: Starting monitored process 154 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:28:04,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-02-08 14:28:04,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,889 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-02-08 14:28:04,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,898 INFO L229 MonitoredProcess]: Starting monitored process 155 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:28:04,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-02-08 14:28:04,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:28:04,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,920 INFO L229 MonitoredProcess]: Starting monitored process 156 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:28:04,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-02-08 14:28:04,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,937 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-02-08 14:28:04,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,946 INFO L229 MonitoredProcess]: Starting monitored process 157 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:28:04,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-02-08 14:28:04,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:04,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:04,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,968 INFO L229 MonitoredProcess]: Starting monitored process 158 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:28:04,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-02-08 14:28:04,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:04,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:04,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:04,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:04,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:04,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:04,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:04,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:04,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:04,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-02-08 14:28:04,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:04,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:04,991 INFO L229 MonitoredProcess]: Starting monitored process 159 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:28:04,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-02-08 14:28:04,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:05,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:05,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:05,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:05,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:05,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:05,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:05,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:05,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:05,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:05,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:05,017 INFO L229 MonitoredProcess]: Starting monitored process 160 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:28:05,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-02-08 14:28:05,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:05,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:05,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:05,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:05,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:05,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:05,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:05,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:05,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:05,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:05,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:05,041 INFO L229 MonitoredProcess]: Starting monitored process 161 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:28:05,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-02-08 14:28:05,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:05,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:05,056 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-02-08 14:28:05,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:05,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:05,060 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-08 14:28:05,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:05,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:05,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-02-08 14:28:05,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:05,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:05,078 INFO L229 MonitoredProcess]: Starting monitored process 162 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:28:05,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-02-08 14:28:05,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:05,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:05,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:05,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:05,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:05,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:05,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:05,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:05,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2025-02-08 14:28:05,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:05,102 INFO L229 MonitoredProcess]: Starting monitored process 163 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:28:05,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-02-08 14:28:05,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:05,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:05,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:05,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:05,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:05,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:05,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:05,133 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:28:05,154 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-08 14:28:05,154 INFO L444 ModelExtractionUtils]: 7 out of 34 variables were initially zero. Simplification set additionally 24 variables to zero. [2025-02-08 14:28:05,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:05,156 INFO L229 MonitoredProcess]: Starting monitored process 164 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:28:05,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-02-08 14:28:05,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:28:05,169 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:28:05,169 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:28:05,169 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~i~0#1 + 1*merge_sort_merge_~n#1 Supporting invariants [] [2025-02-08 14:28:05,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-02-08 14:28:05,253 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2025-02-08 14:28:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:05,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 14:28:05,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:05,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 14:28:05,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:05,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:05,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:28:05,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:05,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:05,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:05,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:05,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:05,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:28:05,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:05,444 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:28:05,445 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-02-08 14:28:05,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 759 states and 1018 transitions. cyclomatic complexity: 309 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:28:05,504 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 759 states and 1018 transitions. cyclomatic complexity: 309. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 777 states and 1049 transitions. Complement of second has 5 states. [2025-02-08 14:28:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 14:28:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-02-08 14:28:05,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 39 letters. Loop has 1 letters. [2025-02-08 14:28:05,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:05,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 40 letters. Loop has 1 letters. [2025-02-08 14:28:05,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:05,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 39 letters. Loop has 2 letters. [2025-02-08 14:28:05,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:05,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 1049 transitions. [2025-02-08 14:28:05,511 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-08 14:28:05,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 777 states and 1049 transitions. [2025-02-08 14:28:05,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 384 [2025-02-08 14:28:05,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 389 [2025-02-08 14:28:05,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 777 states and 1049 transitions. [2025-02-08 14:28:05,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:05,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 777 states and 1049 transitions. [2025-02-08 14:28:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states and 1049 transitions. [2025-02-08 14:28:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 722. [2025-02-08 14:28:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 657 states have (on average 1.3196347031963471) internal successors, (867), 656 states have internal predecessors, (867), 44 states have call successors, (48), 28 states have call predecessors, (48), 21 states have return successors, (58), 37 states have call predecessors, (58), 41 states have call successors, (58) [2025-02-08 14:28:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 973 transitions. [2025-02-08 14:28:05,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 722 states and 973 transitions. [2025-02-08 14:28:05,534 INFO L432 stractBuchiCegarLoop]: Abstraction has 722 states and 973 transitions. [2025-02-08 14:28:05,534 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-08 14:28:05,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 973 transitions. [2025-02-08 14:28:05,537 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-08 14:28:05,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:05,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:05,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:05,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:05,538 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:05,539 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:05,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1245724376, now seen corresponding path program 1 times [2025-02-08 14:28:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:05,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988396364] [2025-02-08 14:28:05,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:05,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 14:28:05,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 14:28:05,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:05,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 14:28:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988396364] [2025-02-08 14:28:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988396364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616735818] [2025-02-08 14:28:05,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:05,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:05,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:05,669 INFO L229 MonitoredProcess]: Starting monitored process 165 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:28:05,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2025-02-08 14:28:05,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 14:28:05,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 14:28:05,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:05,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:05,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 14:28:05,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:28:06,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 14:28:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616735818] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:06,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:06,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 27 [2025-02-08 14:28:06,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591291591] [2025-02-08 14:28:06,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:06,350 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:06,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1085657937, now seen corresponding path program 2 times [2025-02-08 14:28:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:06,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072305656] [2025-02-08 14:28:06,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:06,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:06,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:06,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:28:06,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:06,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:06,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:06,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:06,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:06,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:06,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:06,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:06,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 14:28:06,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-02-08 14:28:06,637 INFO L87 Difference]: Start difference. First operand 722 states and 973 transitions. cyclomatic complexity: 302 Second operand has 27 states, 25 states have (on average 2.96) internal successors, (74), 23 states have internal predecessors, (74), 9 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-08 14:28:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:07,214 INFO L93 Difference]: Finished difference Result 1624 states and 2135 transitions. [2025-02-08 14:28:07,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1624 states and 2135 transitions. [2025-02-08 14:28:07,223 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 322 [2025-02-08 14:28:07,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1624 states to 1620 states and 2131 transitions. [2025-02-08 14:28:07,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 814 [2025-02-08 14:28:07,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 814 [2025-02-08 14:28:07,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1620 states and 2131 transitions. [2025-02-08 14:28:07,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:07,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1620 states and 2131 transitions. [2025-02-08 14:28:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states and 2131 transitions. [2025-02-08 14:28:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 923. [2025-02-08 14:28:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 840 states have (on average 1.305952380952381) internal successors, (1097), 844 states have internal predecessors, (1097), 53 states have call successors, (58), 30 states have call predecessors, (58), 30 states have return successors, (84), 48 states have call predecessors, (84), 50 states have call successors, (84) [2025-02-08 14:28:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1239 transitions. [2025-02-08 14:28:07,246 INFO L240 hiAutomatonCegarLoop]: Abstraction has 923 states and 1239 transitions. [2025-02-08 14:28:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 14:28:07,247 INFO L432 stractBuchiCegarLoop]: Abstraction has 923 states and 1239 transitions. [2025-02-08 14:28:07,247 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-08 14:28:07,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 923 states and 1239 transitions. [2025-02-08 14:28:07,249 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 156 [2025-02-08 14:28:07,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:07,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:07,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:07,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:07,251 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:07,251 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1063573432, now seen corresponding path program 1 times [2025-02-08 14:28:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134055832] [2025-02-08 14:28:07,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:07,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:28:07,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:28:07,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:07,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:07,292 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:07,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:28:07,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:28:07,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:07,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:07,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:07,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1085657937, now seen corresponding path program 3 times [2025-02-08 14:28:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694270911] [2025-02-08 14:28:07,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:07,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:07,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:07,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:28:07,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:07,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:07,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:07,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:07,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:07,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:07,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:07,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 684029576, now seen corresponding path program 2 times [2025-02-08 14:28:07,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:07,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611182163] [2025-02-08 14:28:07,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:07,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:07,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-02-08 14:28:07,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 14:28:07,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:07,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:07,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:07,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 14:28:07,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 14:28:07,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:07,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:07,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:18,571 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:28:18,572 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:28:18,572 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:28:18,572 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:28:18,572 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:28:18,572 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:18,572 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:28:18,572 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:28:18,572 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso [2025-02-08 14:28:18,572 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:28:18,572 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:28:18,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:18,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:19,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:20,626 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:28:20,627 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:28:20,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,629 INFO L229 MonitoredProcess]: Starting monitored process 166 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:28:20,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-02-08 14:28:20,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,657 INFO L229 MonitoredProcess]: Starting monitored process 167 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:28:20,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-02-08 14:28:20,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-02-08 14:28:20,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,678 INFO L229 MonitoredProcess]: Starting monitored process 168 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:28:20,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-02-08 14:28:20,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-02-08 14:28:20,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,702 INFO L229 MonitoredProcess]: Starting monitored process 169 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:28:20,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-02-08 14:28:20,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,722 INFO L229 MonitoredProcess]: Starting monitored process 170 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:28:20,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-02-08 14:28:20,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,743 INFO L229 MonitoredProcess]: Starting monitored process 171 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:28:20,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-02-08 14:28:20,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:20,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:20,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,765 INFO L229 MonitoredProcess]: Starting monitored process 172 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:28:20,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-02-08 14:28:20,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,788 INFO L229 MonitoredProcess]: Starting monitored process 173 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:28:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-02-08 14:28:20,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,804 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,811 INFO L229 MonitoredProcess]: Starting monitored process 174 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:28:20,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-02-08 14:28:20,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,831 INFO L229 MonitoredProcess]: Starting monitored process 175 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:28:20,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-02-08 14:28:20,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,855 INFO L229 MonitoredProcess]: Starting monitored process 176 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:28:20,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-02-08 14:28:20,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,868 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-02-08 14:28:20,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,875 INFO L229 MonitoredProcess]: Starting monitored process 177 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:28:20,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-02-08 14:28:20,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,903 INFO L229 MonitoredProcess]: Starting monitored process 178 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:28:20,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-02-08 14:28:20,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-02-08 14:28:20,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,924 INFO L229 MonitoredProcess]: Starting monitored process 179 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:28:20,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-02-08 14:28:20,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-02-08 14:28:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,945 INFO L229 MonitoredProcess]: Starting monitored process 180 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:28:20,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-02-08 14:28:20,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:20,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,965 INFO L229 MonitoredProcess]: Starting monitored process 181 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:28:20,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-02-08 14:28:20,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:20,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:20,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:20,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:20,985 INFO L229 MonitoredProcess]: Starting monitored process 182 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:28:20,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-02-08 14:28:20,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:20,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:20,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:20,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:20,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:20,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:20,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:20,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:20,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,005 INFO L229 MonitoredProcess]: Starting monitored process 183 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:28:21,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-02-08 14:28:21,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:21,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:21,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:21,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:21,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,025 INFO L229 MonitoredProcess]: Starting monitored process 184 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:28:21,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-02-08 14:28:21,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:21,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:21,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:21,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:21,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,046 INFO L229 MonitoredProcess]: Starting monitored process 185 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:28:21,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-02-08 14:28:21,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:21,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:21,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:21,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:21,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,065 INFO L229 MonitoredProcess]: Starting monitored process 186 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:28:21,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-02-08 14:28:21,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:21,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:21,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:21,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,087 INFO L229 MonitoredProcess]: Starting monitored process 187 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:28:21,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-02-08 14:28:21,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,099 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2025-02-08 14:28:21,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,108 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-02-08 14:28:21,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,144 INFO L229 MonitoredProcess]: Starting monitored process 188 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:28:21,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-02-08 14:28:21,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:21,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-02-08 14:28:21,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,169 INFO L229 MonitoredProcess]: Starting monitored process 189 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:28:21,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-02-08 14:28:21,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:21,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-02-08 14:28:21,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,195 INFO L229 MonitoredProcess]: Starting monitored process 190 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:28:21,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-02-08 14:28:21,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:21,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,236 INFO L229 MonitoredProcess]: Starting monitored process 191 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:28:21,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-02-08 14:28:21,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,260 INFO L229 MonitoredProcess]: Starting monitored process 192 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:28:21,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-02-08 14:28:21,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:21,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:21,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,285 INFO L229 MonitoredProcess]: Starting monitored process 193 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:28:21,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-02-08 14:28:21,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:21,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:21,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:21,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:21,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:21,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:21,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:21,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,306 INFO L229 MonitoredProcess]: Starting monitored process 194 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:28:21,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-02-08 14:28:21,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:21,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:21,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:21,317 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-08 14:28:21,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:21,339 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-08 14:28:21,339 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-08 14:28:21,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:28:21,566 INFO L443 ModelExtractionUtils]: Simplification made 40 calls to the SMT solver. [2025-02-08 14:28:21,566 INFO L444 ModelExtractionUtils]: 6 out of 51 variables were initially zero. Simplification set additionally 42 variables to zero. [2025-02-08 14:28:21,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:21,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:21,568 INFO L229 MonitoredProcess]: Starting monitored process 195 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:28:21,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-02-08 14:28:21,570 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:28:21,581 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-02-08 14:28:21,582 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:28:21,582 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~k~0#1, v_rep(select #length merge_sort_merge_~x~0#1.base)_5) = -8*merge_sort_merge_~k~0#1 + 3*v_rep(select #length merge_sort_merge_~x~0#1.base)_5 Supporting invariants [] [2025-02-08 14:28:21,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-02-08 14:28:21,661 INFO L156 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2025-02-08 14:28:21,662 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:28:21,663 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:28:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:21,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:28:21,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:28:21,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:21,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:21,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 14:28:21,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:21,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:22,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:22,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:28:22,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:22,082 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:28:22,082 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-08 14:28:22,083 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1239 transitions. cyclomatic complexity: 379 Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:22,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:22,303 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 923 states and 1239 transitions. cyclomatic complexity: 379. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 930 states and 1246 transitions. Complement of second has 14 states. [2025-02-08 14:28:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2025-02-08 14:28:22,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 53 letters. Loop has 7 letters. [2025-02-08 14:28:22,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:22,305 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:28:22,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:22,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:28:22,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:28:22,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 14:28:22,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:22,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:22,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:22,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:22,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:22,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:28:22,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:22,781 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:28:22,782 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-08 14:28:22,782 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1239 transitions. cyclomatic complexity: 379 Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:22,956 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 923 states and 1239 transitions. cyclomatic complexity: 379. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 930 states and 1246 transitions. Complement of second has 14 states. [2025-02-08 14:28:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 9 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2025-02-08 14:28:22,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 53 letters. Loop has 7 letters. [2025-02-08 14:28:22,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:22,961 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:28:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:23,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 14:28:23,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 14:28:23,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:23,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:23,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 14:28:23,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:23,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:23,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:23,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:23,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:23,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 14:28:23,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:23,476 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:28:23,476 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-02-08 14:28:23,477 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 923 states and 1239 transitions. cyclomatic complexity: 379 Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:23,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 923 states and 1239 transitions. cyclomatic complexity: 379. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 994 states and 1322 transitions. Complement of second has 20 states. [2025-02-08 14:28:23,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-08 14:28:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2025-02-08 14:28:23,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 53 letters. Loop has 7 letters. [2025-02-08 14:28:23,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:23,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 60 letters. Loop has 7 letters. [2025-02-08 14:28:23,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:23,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 64 transitions. Stem has 53 letters. Loop has 14 letters. [2025-02-08 14:28:23,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:23,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 994 states and 1322 transitions. [2025-02-08 14:28:23,714 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 165 [2025-02-08 14:28:23,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 994 states to 984 states and 1312 transitions. [2025-02-08 14:28:23,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 483 [2025-02-08 14:28:23,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 518 [2025-02-08 14:28:23,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 984 states and 1312 transitions. [2025-02-08 14:28:23,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:23,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 984 states and 1312 transitions. [2025-02-08 14:28:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states and 1312 transitions. [2025-02-08 14:28:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 950. [2025-02-08 14:28:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 867 states have (on average 1.309111880046136) internal successors, (1135), 870 states have internal predecessors, (1135), 53 states have call successors, (58), 30 states have call predecessors, (58), 30 states have return successors, (84), 49 states have call predecessors, (84), 50 states have call successors, (84) [2025-02-08 14:28:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1277 transitions. [2025-02-08 14:28:23,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 950 states and 1277 transitions. [2025-02-08 14:28:23,731 INFO L432 stractBuchiCegarLoop]: Abstraction has 950 states and 1277 transitions. [2025-02-08 14:28:23,731 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-08 14:28:23,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 950 states and 1277 transitions. [2025-02-08 14:28:23,733 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 156 [2025-02-08 14:28:23,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:23,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:23,736 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:28:23,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:28:23,736 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" [2025-02-08 14:28:23,736 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" [2025-02-08 14:28:23,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash -942366181, now seen corresponding path program 3 times [2025-02-08 14:28:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455238966] [2025-02-08 14:28:23,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:23,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 5 equivalence classes. [2025-02-08 14:28:23,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 56 statements. [2025-02-08 14:28:23,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:28:23,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 23 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-08 14:28:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:23,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455238966] [2025-02-08 14:28:23,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455238966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:23,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951568050] [2025-02-08 14:28:23,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:23,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:23,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:23,911 INFO L229 MonitoredProcess]: Starting monitored process 196 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:28:23,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2025-02-08 14:28:23,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 5 equivalence classes. [2025-02-08 14:28:24,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 56 statements. [2025-02-08 14:28:24,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:28:24,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:24,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:28:24,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-08 14:28:24,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-08 14:28:24,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951568050] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:24,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:24,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2025-02-08 14:28:24,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216236984] [2025-02-08 14:28:24,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:24,153 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:24,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2025-02-08 14:28:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960697199] [2025-02-08 14:28:24,153 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:24,156 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:24,157 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:24,157 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:28:24,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:24,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:24,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:24,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:24,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:24,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:24,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:24,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 14:28:24,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-08 14:28:24,200 INFO L87 Difference]: Start difference. First operand 950 states and 1277 transitions. cyclomatic complexity: 391 Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:24,322 INFO L93 Difference]: Finished difference Result 1033 states and 1386 transitions. [2025-02-08 14:28:24,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1033 states and 1386 transitions. [2025-02-08 14:28:24,326 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 156 [2025-02-08 14:28:24,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1033 states to 1026 states and 1375 transitions. [2025-02-08 14:28:24,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 537 [2025-02-08 14:28:24,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 537 [2025-02-08 14:28:24,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1026 states and 1375 transitions. [2025-02-08 14:28:24,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:24,330 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1375 transitions. [2025-02-08 14:28:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states and 1375 transitions. [2025-02-08 14:28:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 978. [2025-02-08 14:28:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 895 states have (on average 1.3050279329608938) internal successors, (1168), 898 states have internal predecessors, (1168), 53 states have call successors, (58), 30 states have call predecessors, (58), 30 states have return successors, (84), 49 states have call predecessors, (84), 50 states have call successors, (84) [2025-02-08 14:28:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1310 transitions. [2025-02-08 14:28:24,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 978 states and 1310 transitions. [2025-02-08 14:28:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:28:24,343 INFO L432 stractBuchiCegarLoop]: Abstraction has 978 states and 1310 transitions. [2025-02-08 14:28:24,343 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-08 14:28:24,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 978 states and 1310 transitions. [2025-02-08 14:28:24,345 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 156 [2025-02-08 14:28:24,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:24,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:24,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:28:24,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:28:24,346 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" [2025-02-08 14:28:24,346 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" [2025-02-08 14:28:24,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2124349666, now seen corresponding path program 4 times [2025-02-08 14:28:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:24,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72342067] [2025-02-08 14:28:24,347 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:24,355 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-02-08 14:28:24,368 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 14:28:24,369 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:24,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 14 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 14:28:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:24,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72342067] [2025-02-08 14:28:24,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72342067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:24,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116355770] [2025-02-08 14:28:24,622 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:24,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:24,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:24,624 INFO L229 MonitoredProcess]: Starting monitored process 197 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:28:24,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Waiting until timeout for monitored process [2025-02-08 14:28:24,699 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-02-08 14:28:24,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 14:28:24,805 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:24,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:24,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 14:28:24,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 14:28:24,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-08 14:28:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116355770] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:24,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:24,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2025-02-08 14:28:24,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652680516] [2025-02-08 14:28:24,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:24,979 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:24,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2025-02-08 14:28:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396129059] [2025-02-08 14:28:24,979 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:28:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:24,982 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:24,982 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:24,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:28:24,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:24,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:24,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:24,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:24,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:24,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:25,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 14:28:25,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-02-08 14:28:25,027 INFO L87 Difference]: Start difference. First operand 978 states and 1310 transitions. cyclomatic complexity: 396 Second operand has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 14:28:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:25,253 INFO L93 Difference]: Finished difference Result 2337 states and 3034 transitions. [2025-02-08 14:28:25,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2337 states and 3034 transitions. [2025-02-08 14:28:25,260 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 355 [2025-02-08 14:28:25,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2337 states to 2277 states and 2953 transitions. [2025-02-08 14:28:25,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1124 [2025-02-08 14:28:25,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1124 [2025-02-08 14:28:25,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2277 states and 2953 transitions. [2025-02-08 14:28:25,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:25,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2277 states and 2953 transitions. [2025-02-08 14:28:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states and 2953 transitions. [2025-02-08 14:28:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 1210. [2025-02-08 14:28:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1120 states have (on average 1.26875) internal successors, (1421), 1117 states have internal predecessors, (1421), 59 states have call successors, (64), 30 states have call predecessors, (64), 31 states have return successors, (96), 62 states have call predecessors, (96), 56 states have call successors, (96) [2025-02-08 14:28:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1581 transitions. [2025-02-08 14:28:25,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1210 states and 1581 transitions. [2025-02-08 14:28:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 14:28:25,287 INFO L432 stractBuchiCegarLoop]: Abstraction has 1210 states and 1581 transitions. [2025-02-08 14:28:25,287 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-08 14:28:25,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1210 states and 1581 transitions. [2025-02-08 14:28:25,289 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 243 [2025-02-08 14:28:25,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:25,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:25,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:25,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:28:25,290 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" [2025-02-08 14:28:25,290 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" [2025-02-08 14:28:25,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 92257625, now seen corresponding path program 1 times [2025-02-08 14:28:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:25,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527948667] [2025-02-08 14:28:25,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:25,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 14:28:25,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 14:28:25,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:25,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-08 14:28:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:25,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527948667] [2025-02-08 14:28:25,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527948667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:25,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741621907] [2025-02-08 14:28:25,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:25,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:25,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:25,434 INFO L229 MonitoredProcess]: Starting monitored process 198 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:28:25,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2025-02-08 14:28:25,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 14:28:25,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 14:28:25,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:25,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:25,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 14:28:25,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 14:28:25,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 14:28:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741621907] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:25,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:25,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 19 [2025-02-08 14:28:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354925368] [2025-02-08 14:28:25,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:25,815 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:25,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:25,816 INFO L85 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2025-02-08 14:28:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:25,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330021921] [2025-02-08 14:28:25,816 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:28:25,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:25,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:25,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:25,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:25,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:25,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:25,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:25,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:25,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:25,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:25,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:25,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:28:25,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:28:25,862 INFO L87 Difference]: Start difference. First operand 1210 states and 1581 transitions. cyclomatic complexity: 442 Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 16 states have internal predecessors, (75), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-08 14:28:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:26,186 INFO L93 Difference]: Finished difference Result 1780 states and 2313 transitions. [2025-02-08 14:28:26,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1780 states and 2313 transitions. [2025-02-08 14:28:26,192 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 427 [2025-02-08 14:28:26,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1780 states to 1780 states and 2313 transitions. [2025-02-08 14:28:26,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1111 [2025-02-08 14:28:26,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1111 [2025-02-08 14:28:26,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1780 states and 2313 transitions. [2025-02-08 14:28:26,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:26,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1780 states and 2313 transitions. [2025-02-08 14:28:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states and 2313 transitions. [2025-02-08 14:28:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1517. [2025-02-08 14:28:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1428 states have (on average 1.2633053221288515) internal successors, (1804), 1416 states have internal predecessors, (1804), 59 states have call successors, (64), 31 states have call predecessors, (64), 30 states have return successors, (94), 69 states have call predecessors, (94), 56 states have call successors, (94) [2025-02-08 14:28:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1962 transitions. [2025-02-08 14:28:26,224 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1517 states and 1962 transitions. [2025-02-08 14:28:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 14:28:26,225 INFO L432 stractBuchiCegarLoop]: Abstraction has 1517 states and 1962 transitions. [2025-02-08 14:28:26,225 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-08 14:28:26,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1517 states and 1962 transitions. [2025-02-08 14:28:26,228 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 327 [2025-02-08 14:28:26,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:26,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:26,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:28:26,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-08 14:28:26,229 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" [2025-02-08 14:28:26,229 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" [2025-02-08 14:28:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1694716965, now seen corresponding path program 5 times [2025-02-08 14:28:26,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:26,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681489631] [2025-02-08 14:28:26,230 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:26,241 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 5 equivalence classes. [2025-02-08 14:28:26,286 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 14:28:26,286 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 14:28:26,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:26,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:26,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 14:28:26,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 14:28:26,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:26,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:26,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:26,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2025-02-08 14:28:26,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:26,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597532112] [2025-02-08 14:28:26,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:26,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:26,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:26,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:28:26,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:26,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:26,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:26,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:26,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:26,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:26,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:26,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:26,332 INFO L85 PathProgramCache]: Analyzing trace with hash -996618362, now seen corresponding path program 6 times [2025-02-08 14:28:26,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:26,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63390347] [2025-02-08 14:28:26,332 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:28:26,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:26,342 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 64 statements into 5 equivalence classes. [2025-02-08 14:28:26,380 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 14:28:26,381 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 14:28:26,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:26,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:26,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 14:28:26,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 14:28:26,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:26,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:26,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:33,160 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:28:33,160 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:28:33,160 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:28:33,160 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:28:33,160 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:28:33,160 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:33,161 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:28:33,161 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:28:33,161 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration21_Lasso [2025-02-08 14:28:33,161 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:28:33,161 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:28:33,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:33,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:34,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:35,095 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:28:35,095 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:28:35,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:35,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:35,102 INFO L229 MonitoredProcess]: Starting monitored process 199 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:28:35,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-02-08 14:28:35,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:35,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:35,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:35,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:35,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:35,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:35,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:35,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:35,122 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:35,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-02-08 14:28:35,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:35,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:35,132 INFO L229 MonitoredProcess]: Starting monitored process 200 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:28:35,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-02-08 14:28:35,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:35,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:35,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:35,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:35,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:35,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:35,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:35,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:35,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2025-02-08 14:28:35,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:35,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:35,160 INFO L229 MonitoredProcess]: Starting monitored process 201 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:28:35,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-02-08 14:28:35,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:35,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:35,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:35,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:35,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:35,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:35,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:35,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:35,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:35,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:35,194 INFO L229 MonitoredProcess]: Starting monitored process 202 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:28:35,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-02-08 14:28:35,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:35,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:35,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:35,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:35,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:35,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:35,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:35,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:35,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:35,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:35,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:35,221 INFO L229 MonitoredProcess]: Starting monitored process 203 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:28:35,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-02-08 14:28:35,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:35,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:35,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:35,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:35,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:35,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:35,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:35,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:35,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-02-08 14:28:35,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:35,310 INFO L229 MonitoredProcess]: Starting monitored process 204 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:28:35,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-02-08 14:28:35,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:35,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:35,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:35,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:35,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:35,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:35,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:35,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:35,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:35,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:35,336 INFO L229 MonitoredProcess]: Starting monitored process 205 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:28:35,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-02-08 14:28:35,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:35,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:35,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:35,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:35,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:35,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:35,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:35,363 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:28:35,379 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-02-08 14:28:35,379 INFO L444 ModelExtractionUtils]: 2 out of 31 variables were initially zero. Simplification set additionally 25 variables to zero. [2025-02-08 14:28:35,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:35,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:35,381 INFO L229 MonitoredProcess]: Starting monitored process 206 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:28:35,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-02-08 14:28:35,383 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:28:35,393 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-08 14:28:35,394 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:28:35,394 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~x~0#1.base)_6, merge_sort_merge_~x~0#1.offset, merge_sort_merge_~i~0#1) = 2*v_rep(select #length merge_sort_merge_~x~0#1.base)_6 - 1*merge_sort_merge_~x~0#1.offset - 4*merge_sort_merge_~i~0#1 Supporting invariants [] [2025-02-08 14:28:35,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:35,457 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2025-02-08 14:28:35,458 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~x~0!offset [2025-02-08 14:28:35,459 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:28:35,459 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:28:35,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:35,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 14:28:35,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 14:28:35,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:35,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:35,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:28:35,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:35,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:35,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:35,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:35,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:35,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:28:35,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:35,714 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:28:35,715 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-02-08 14:28:35,715 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1517 states and 1962 transitions. cyclomatic complexity: 533 Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:35,743 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1517 states and 1962 transitions. cyclomatic complexity: 533. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1531 states and 1978 transitions. Complement of second has 5 states. [2025-02-08 14:28:35,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-02-08 14:28:35,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 63 letters. Loop has 1 letters. [2025-02-08 14:28:35,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:35,744 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:28:35,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:35,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 14:28:35,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 14:28:35,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:35,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:35,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:28:35,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:35,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:35,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:35,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:35,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:35,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:28:35,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:35,988 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:28:35,988 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 1 loop predicates [2025-02-08 14:28:35,988 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1517 states and 1962 transitions. cyclomatic complexity: 533 Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:36,014 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1517 states and 1962 transitions. cyclomatic complexity: 533. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1531 states and 1978 transitions. Complement of second has 5 states. [2025-02-08 14:28:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-02-08 14:28:36,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 63 letters. Loop has 1 letters. [2025-02-08 14:28:36,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:36,018 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:28:36,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:36,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 14:28:36,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 14:28:36,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:36,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:36,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:28:36,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:36,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:28:36,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:28:36,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:36,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:36,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:28:36,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:36,266 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:28:36,266 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-02-08 14:28:36,266 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1517 states and 1962 transitions. cyclomatic complexity: 533 Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:36,312 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1517 states and 1962 transitions. cyclomatic complexity: 533. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1518 states and 1963 transitions. Complement of second has 5 states. [2025-02-08 14:28:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-02-08 14:28:36,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 63 letters. Loop has 1 letters. [2025-02-08 14:28:36,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:36,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 64 letters. Loop has 1 letters. [2025-02-08 14:28:36,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:36,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 63 letters. Loop has 2 letters. [2025-02-08 14:28:36,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:36,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1518 states and 1963 transitions. [2025-02-08 14:28:36,322 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 319 [2025-02-08 14:28:36,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1518 states to 1404 states and 1806 transitions. [2025-02-08 14:28:36,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 860 [2025-02-08 14:28:36,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 867 [2025-02-08 14:28:36,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1404 states and 1806 transitions. [2025-02-08 14:28:36,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:36,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1404 states and 1806 transitions. [2025-02-08 14:28:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states and 1806 transitions. [2025-02-08 14:28:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1297. [2025-02-08 14:28:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1215 states have (on average 1.2625514403292182) internal successors, (1534), 1203 states have internal predecessors, (1534), 54 states have call successors, (59), 28 states have call predecessors, (59), 28 states have return successors, (90), 65 states have call predecessors, (90), 52 states have call successors, (90) [2025-02-08 14:28:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1683 transitions. [2025-02-08 14:28:36,357 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1297 states and 1683 transitions. [2025-02-08 14:28:36,358 INFO L432 stractBuchiCegarLoop]: Abstraction has 1297 states and 1683 transitions. [2025-02-08 14:28:36,358 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-08 14:28:36,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1297 states and 1683 transitions. [2025-02-08 14:28:36,362 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 308 [2025-02-08 14:28:36,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:36,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:36,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:36,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:36,363 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" [2025-02-08 14:28:36,363 INFO L754 eck$LassoCheckResult]: Loop: "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" [2025-02-08 14:28:36,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1514291083, now seen corresponding path program 7 times [2025-02-08 14:28:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:36,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009074150] [2025-02-08 14:28:36,364 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:28:36,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:36,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 14:28:36,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 14:28:36,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:36,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:36,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2025-02-08 14:28:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 14:28:36,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:36,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009074150] [2025-02-08 14:28:36,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009074150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:36,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861341309] [2025-02-08 14:28:36,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:28:36,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:36,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:36,626 INFO L229 MonitoredProcess]: Starting monitored process 207 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:28:36,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Waiting until timeout for monitored process [2025-02-08 14:28:36,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 14:28:36,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 14:28:36,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:36,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:36,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 14:28:36,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 14:28:36,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 14:28:37,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861341309] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:37,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 21 [2025-02-08 14:28:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844303679] [2025-02-08 14:28:37,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:37,336 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:37,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash -167646297, now seen corresponding path program 4 times [2025-02-08 14:28:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:37,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781446752] [2025-02-08 14:28:37,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:37,339 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-02-08 14:28:37,341 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:28:37,341 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:37,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:37,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:37,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:37,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:37,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:37,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:37,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:37,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:37,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 14:28:37,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-02-08 14:28:37,478 INFO L87 Difference]: Start difference. First operand 1297 states and 1683 transitions. cyclomatic complexity: 460 Second operand has 21 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 11 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-08 14:28:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:37,652 INFO L93 Difference]: Finished difference Result 1117 states and 1488 transitions. [2025-02-08 14:28:37,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1117 states and 1488 transitions. [2025-02-08 14:28:37,656 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 291 [2025-02-08 14:28:37,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1117 states to 1117 states and 1488 transitions. [2025-02-08 14:28:37,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 635 [2025-02-08 14:28:37,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 635 [2025-02-08 14:28:37,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1117 states and 1488 transitions. [2025-02-08 14:28:37,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:37,661 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1117 states and 1488 transitions. [2025-02-08 14:28:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states and 1488 transitions. [2025-02-08 14:28:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 973. [2025-02-08 14:28:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 909 states have (on average 1.262926292629263) internal successors, (1148), 903 states have internal predecessors, (1148), 42 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (72), 48 states have call predecessors, (72), 40 states have call successors, (72) [2025-02-08 14:28:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1265 transitions. [2025-02-08 14:28:37,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 973 states and 1265 transitions. [2025-02-08 14:28:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 14:28:37,674 INFO L432 stractBuchiCegarLoop]: Abstraction has 973 states and 1265 transitions. [2025-02-08 14:28:37,674 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-08 14:28:37,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 973 states and 1265 transitions. [2025-02-08 14:28:37,676 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 223 [2025-02-08 14:28:37,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:37,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:37,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:37,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-08 14:28:37,676 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< [2025-02-08 14:28:37,676 INFO L754 eck$LassoCheckResult]: Loop: "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< [2025-02-08 14:28:37,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash -940249432, now seen corresponding path program 4 times [2025-02-08 14:28:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009703772] [2025-02-08 14:28:37,677 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:37,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:37,681 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 14:28:37,685 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-02-08 14:28:37,686 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:28:37,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 14:28:37,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:37,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009703772] [2025-02-08 14:28:37,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009703772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:37,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728550576] [2025-02-08 14:28:37,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:37,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:37,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:37,861 INFO L229 MonitoredProcess]: Starting monitored process 208 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:28:37,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (208)] Waiting until timeout for monitored process [2025-02-08 14:28:37,946 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 14:28:37,960 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-02-08 14:28:37,960 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:28:37,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:37,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:28:37,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 14:28:38,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 14:28:38,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728550576] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:38,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:38,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-02-08 14:28:38,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277038303] [2025-02-08 14:28:38,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:38,108 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:38,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash 49635, now seen corresponding path program 5 times [2025-02-08 14:28:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457671934] [2025-02-08 14:28:38,109 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:38,111 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:38,112 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:38,112 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:28:38,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:38,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:38,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:28:38,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:28:38,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:38,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:38,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:38,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 14:28:38,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-08 14:28:38,221 INFO L87 Difference]: Start difference. First operand 973 states and 1265 transitions. cyclomatic complexity: 348 Second operand has 18 states, 10 states have (on average 2.2) internal successors, (22), 13 states have internal predecessors, (22), 9 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 14:28:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:38,405 INFO L93 Difference]: Finished difference Result 420 states and 547 transitions. [2025-02-08 14:28:38,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 420 states and 547 transitions. [2025-02-08 14:28:38,407 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 151 [2025-02-08 14:28:38,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 420 states to 413 states and 540 transitions. [2025-02-08 14:28:38,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 360 [2025-02-08 14:28:38,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 363 [2025-02-08 14:28:38,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 540 transitions. [2025-02-08 14:28:38,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:38,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 413 states and 540 transitions. [2025-02-08 14:28:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 540 transitions. [2025-02-08 14:28:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 380. [2025-02-08 14:28:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 346 states have (on average 1.2485549132947977) internal successors, (432), 344 states have internal predecessors, (432), 22 states have call successors, (23), 16 states have call predecessors, (23), 12 states have return successors, (41), 19 states have call predecessors, (41), 20 states have call successors, (41) [2025-02-08 14:28:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 496 transitions. [2025-02-08 14:28:38,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 380 states and 496 transitions. [2025-02-08 14:28:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:28:38,415 INFO L432 stractBuchiCegarLoop]: Abstraction has 380 states and 496 transitions. [2025-02-08 14:28:38,415 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-08 14:28:38,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 496 transitions. [2025-02-08 14:28:38,416 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 134 [2025-02-08 14:28:38,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:38,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:38,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:38,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:38,416 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:38,417 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:38,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1816113134, now seen corresponding path program 8 times [2025-02-08 14:28:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:38,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624096803] [2025-02-08 14:28:38,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:38,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:38,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-08 14:28:38,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 14:28:38,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:38,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 14:28:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:38,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624096803] [2025-02-08 14:28:38,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624096803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:38,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862644509] [2025-02-08 14:28:38,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:38,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:38,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:38,615 INFO L229 MonitoredProcess]: Starting monitored process 209 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:28:38,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (209)] Waiting until timeout for monitored process [2025-02-08 14:28:38,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-08 14:28:38,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 14:28:38,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:38,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:38,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:28:38,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-08 14:28:38,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-08 14:28:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862644509] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:38,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:38,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2025-02-08 14:28:38,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367300459] [2025-02-08 14:28:38,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:38,897 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:38,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1085657937, now seen corresponding path program 5 times [2025-02-08 14:28:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:38,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320902402] [2025-02-08 14:28:38,897 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:38,901 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:38,902 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:38,902 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:28:38,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:38,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:38,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:38,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:38,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:38,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:38,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:39,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:28:39,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:28:39,048 INFO L87 Difference]: Start difference. First operand 380 states and 496 transitions. cyclomatic complexity: 137 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-08 14:28:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:39,155 INFO L93 Difference]: Finished difference Result 728 states and 963 transitions. [2025-02-08 14:28:39,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 728 states and 963 transitions. [2025-02-08 14:28:39,157 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 269 [2025-02-08 14:28:39,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 728 states to 728 states and 963 transitions. [2025-02-08 14:28:39,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 593 [2025-02-08 14:28:39,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 593 [2025-02-08 14:28:39,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 728 states and 963 transitions. [2025-02-08 14:28:39,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:39,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 728 states and 963 transitions. [2025-02-08 14:28:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states and 963 transitions. [2025-02-08 14:28:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 385. [2025-02-08 14:28:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 351 states have (on average 1.245014245014245) internal successors, (437), 349 states have internal predecessors, (437), 22 states have call successors, (23), 16 states have call predecessors, (23), 12 states have return successors, (41), 19 states have call predecessors, (41), 20 states have call successors, (41) [2025-02-08 14:28:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 501 transitions. [2025-02-08 14:28:39,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 385 states and 501 transitions. [2025-02-08 14:28:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:28:39,168 INFO L432 stractBuchiCegarLoop]: Abstraction has 385 states and 501 transitions. [2025-02-08 14:28:39,168 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-02-08 14:28:39,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 385 states and 501 transitions. [2025-02-08 14:28:39,169 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 134 [2025-02-08 14:28:39,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:39,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:39,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:39,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:39,169 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:39,169 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash -330123653, now seen corresponding path program 9 times [2025-02-08 14:28:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665778786] [2025-02-08 14:28:39,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:39,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 5 equivalence classes. [2025-02-08 14:28:39,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 14:28:39,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 14:28:39,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 14:28:39,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665778786] [2025-02-08 14:28:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665778786] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129086337] [2025-02-08 14:28:39,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:39,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:39,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:39,715 INFO L229 MonitoredProcess]: Starting monitored process 210 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:28:39,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (210)] Waiting until timeout for monitored process [2025-02-08 14:28:39,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 5 equivalence classes. [2025-02-08 14:28:39,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 14:28:39,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 14:28:39,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:39,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 14:28:39,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 14:28:40,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 14:28:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129086337] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:40,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:40,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 35 [2025-02-08 14:28:40,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703666687] [2025-02-08 14:28:40,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:40,396 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:40,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1085657937, now seen corresponding path program 6 times [2025-02-08 14:28:40,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:40,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166840629] [2025-02-08 14:28:40,397 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:28:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:40,399 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:40,401 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:40,401 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:28:40,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:40,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:40,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:40,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:40,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:40,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:40,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:40,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:40,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 14:28:40,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 14:28:40,542 INFO L87 Difference]: Start difference. First operand 385 states and 501 transitions. cyclomatic complexity: 137 Second operand has 35 states, 28 states have (on average 2.142857142857143) internal successors, (60), 30 states have internal predecessors, (60), 9 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 14:28:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:40,964 INFO L93 Difference]: Finished difference Result 638 states and 819 transitions. [2025-02-08 14:28:40,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 638 states and 819 transitions. [2025-02-08 14:28:40,967 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 206 [2025-02-08 14:28:40,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 638 states to 635 states and 815 transitions. [2025-02-08 14:28:40,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 504 [2025-02-08 14:28:40,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 504 [2025-02-08 14:28:40,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 635 states and 815 transitions. [2025-02-08 14:28:40,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:40,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 635 states and 815 transitions. [2025-02-08 14:28:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states and 815 transitions. [2025-02-08 14:28:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 566. [2025-02-08 14:28:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 515 states have (on average 1.250485436893204) internal successors, (644), 516 states have internal predecessors, (644), 32 states have call successors, (34), 24 states have call predecessors, (34), 19 states have return successors, (50), 25 states have call predecessors, (50), 28 states have call successors, (50) [2025-02-08 14:28:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 728 transitions. [2025-02-08 14:28:40,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 566 states and 728 transitions. [2025-02-08 14:28:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-08 14:28:40,978 INFO L432 stractBuchiCegarLoop]: Abstraction has 566 states and 728 transitions. [2025-02-08 14:28:40,978 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-02-08 14:28:40,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 728 transitions. [2025-02-08 14:28:40,979 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 158 [2025-02-08 14:28:40,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:40,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:40,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:40,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:40,979 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:40,980 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1176609888, now seen corresponding path program 10 times [2025-02-08 14:28:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330333912] [2025-02-08 14:28:40,980 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:40,988 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 62 statements into 2 equivalence classes. [2025-02-08 14:28:41,006 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 14:28:41,007 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:41,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:41,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:41,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 14:28:41,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 14:28:41,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:41,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:41,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:41,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1085657937, now seen corresponding path program 7 times [2025-02-08 14:28:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172257234] [2025-02-08 14:28:41,026 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:28:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:41,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:41,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:41,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:41,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:41,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:41,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:41,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:41,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:41,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:41,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1331146608, now seen corresponding path program 11 times [2025-02-08 14:28:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:41,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135254899] [2025-02-08 14:28:41,033 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:41,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 8 equivalence classes. [2025-02-08 14:28:41,066 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 14:28:41,066 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-08 14:28:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-08 14:28:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135254899] [2025-02-08 14:28:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135254899] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537673931] [2025-02-08 14:28:41,335 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:28:41,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:41,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:41,340 INFO L229 MonitoredProcess]: Starting monitored process 211 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:28:41,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (211)] Waiting until timeout for monitored process [2025-02-08 14:28:41,453 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 8 equivalence classes. [2025-02-08 14:28:41,554 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 14:28:41,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-08 14:28:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:41,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:28:41,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-08 14:28:41,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:28:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537673931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:28:41,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:28:41,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-02-08 14:28:41,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162755138] [2025-02-08 14:28:41,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:28:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:41,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 14:28:41,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-08 14:28:41,784 INFO L87 Difference]: Start difference. First operand 566 states and 728 transitions. cyclomatic complexity: 195 Second operand has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 14:28:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:41,853 INFO L93 Difference]: Finished difference Result 668 states and 818 transitions. [2025-02-08 14:28:41,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 668 states and 818 transitions. [2025-02-08 14:28:41,855 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 141 [2025-02-08 14:28:41,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 668 states to 593 states and 734 transitions. [2025-02-08 14:28:41,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 483 [2025-02-08 14:28:41,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 552 [2025-02-08 14:28:41,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 593 states and 734 transitions. [2025-02-08 14:28:41,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:41,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 593 states and 734 transitions. [2025-02-08 14:28:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states and 734 transitions. [2025-02-08 14:28:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 560. [2025-02-08 14:28:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 509 states have (on average 1.2121807465618861) internal successors, (617), 509 states have internal predecessors, (617), 32 states have call successors, (34), 24 states have call predecessors, (34), 19 states have return successors, (50), 26 states have call predecessors, (50), 28 states have call successors, (50) [2025-02-08 14:28:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 701 transitions. [2025-02-08 14:28:41,864 INFO L240 hiAutomatonCegarLoop]: Abstraction has 560 states and 701 transitions. [2025-02-08 14:28:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:28:41,864 INFO L432 stractBuchiCegarLoop]: Abstraction has 560 states and 701 transitions. [2025-02-08 14:28:41,864 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-02-08 14:28:41,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 560 states and 701 transitions. [2025-02-08 14:28:41,865 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 141 [2025-02-08 14:28:41,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:41,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:41,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:28:41,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:41,866 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" [2025-02-08 14:28:41,867 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" [2025-02-08 14:28:41,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1708538792, now seen corresponding path program 12 times [2025-02-08 14:28:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:41,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554876637] [2025-02-08 14:28:41,867 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:28:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:41,876 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 74 statements into 8 equivalence classes. [2025-02-08 14:28:41,946 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:28:41,947 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 14:28:41,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:41,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:41,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:28:41,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:28:41,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:41,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:41,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:41,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1345531790, now seen corresponding path program 2 times [2025-02-08 14:28:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:41,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19249884] [2025-02-08 14:28:41,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:41,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:41,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:41,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:28:41,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:41,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:41,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:41,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:41,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:41,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:41,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:41,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:41,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1993923079, now seen corresponding path program 1 times [2025-02-08 14:28:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:41,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111792642] [2025-02-08 14:28:41,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:28:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:41,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 14:28:42,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 14:28:42,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:42,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:42,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:42,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 14:28:42,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 14:28:42,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:42,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:49,617 INFO L204 LassoAnalysis]: Preferences: [2025-02-08 14:28:49,617 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-08 14:28:49,618 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-08 14:28:49,618 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-08 14:28:49,618 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-08 14:28:49,618 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:49,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-08 14:28:49,618 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-08 14:28:49,618 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration27_Lasso [2025-02-08 14:28:49,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-08 14:28:49,618 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-08 14:28:49,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:49,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:50,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-08 14:28:51,191 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-08 14:28:51,191 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-08 14:28:51,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,201 INFO L229 MonitoredProcess]: Starting monitored process 212 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:28:51,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-02-08 14:28:51,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2025-02-08 14:28:51,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,224 INFO L229 MonitoredProcess]: Starting monitored process 213 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:28:51,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2025-02-08 14:28:51,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-08 14:28:51,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,256 INFO L229 MonitoredProcess]: Starting monitored process 214 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:28:51,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2025-02-08 14:28:51,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:28:51,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,278 INFO L229 MonitoredProcess]: Starting monitored process 215 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:28:51,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2025-02-08 14:28:51,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2025-02-08 14:28:51,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,303 INFO L229 MonitoredProcess]: Starting monitored process 216 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:28:51,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2025-02-08 14:28:51,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,326 INFO L229 MonitoredProcess]: Starting monitored process 217 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:28:51,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2025-02-08 14:28:51,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,349 INFO L229 MonitoredProcess]: Starting monitored process 218 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:28:51,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2025-02-08 14:28:51,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Ended with exit code 0 [2025-02-08 14:28:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,370 INFO L229 MonitoredProcess]: Starting monitored process 219 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:28:51,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2025-02-08 14:28:51,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,383 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,391 INFO L229 MonitoredProcess]: Starting monitored process 220 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:28:51,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2025-02-08 14:28:51,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,412 INFO L229 MonitoredProcess]: Starting monitored process 221 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:28:51,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2025-02-08 14:28:51,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2025-02-08 14:28:51,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,442 INFO L229 MonitoredProcess]: Starting monitored process 222 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:28:51,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2025-02-08 14:28:51,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2025-02-08 14:28:51,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,466 INFO L229 MonitoredProcess]: Starting monitored process 223 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:28:51,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2025-02-08 14:28:51,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,489 INFO L229 MonitoredProcess]: Starting monitored process 224 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:28:51,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2025-02-08 14:28:51,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-08 14:28:51,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-08 14:28:51,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-08 14:28:51,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,512 INFO L229 MonitoredProcess]: Starting monitored process 225 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:28:51,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2025-02-08 14:28:51,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-08 14:28:51,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-08 14:28:51,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-08 14:28:51,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-08 14:28:51,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Forceful destruction successful, exit code 0 [2025-02-08 14:28:51,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:51,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:51,539 INFO L229 MonitoredProcess]: Starting monitored process 226 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:28:51,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2025-02-08 14:28:51,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:28:51,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-08 14:28:51,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-08 14:28:51,554 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-02-08 14:28:51,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-08 14:28:51,614 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-02-08 14:28:51,614 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-02-08 14:28:51,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-08 14:28:52,238 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2025-02-08 14:28:52,238 INFO L444 ModelExtractionUtils]: 12 out of 109 variables were initially zero. Simplification set additionally 94 variables to zero. [2025-02-08 14:28:52,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:28:52,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:52,242 INFO L229 MonitoredProcess]: Starting monitored process 227 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:28:52,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2025-02-08 14:28:52,243 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-08 14:28:52,257 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-02-08 14:28:52,257 INFO L474 LassoAnalysis]: Proved termination. [2025-02-08 14:28:52,257 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_#in~a#1.base)_9) = -16*merge_sort_merge_~i~0#1 + 5*v_rep(select #length merge_sort_#in~a#1.base)_9 Supporting invariants [] [2025-02-08 14:28:52,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2025-02-08 14:28:52,308 INFO L156 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2025-02-08 14:28:52,312 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-08 14:28:52,315 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-08 14:28:52,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:52,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:28:52,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:28:52,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:52,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:52,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-08 14:28:52,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:52,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2025-02-08 14:28:53,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:53,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:53,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:53,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:53,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:28:53,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:53,453 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:28:53,454 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.25 stem predicates 2 loop predicates [2025-02-08 14:28:53,455 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 560 states and 701 transitions. cyclomatic complexity: 164 Second operand has 27 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 14:28:53,980 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 560 states and 701 transitions. cyclomatic complexity: 164. Second operand has 27 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 583 states and 730 transitions. Complement of second has 29 states. [2025-02-08 14:28:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 16 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 14:28:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 29 transitions. [2025-02-08 14:28:53,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 29 transitions. Stem has 74 letters. Loop has 7 letters. [2025-02-08 14:28:53,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:53,982 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:28:53,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:54,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:28:54,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:28:54,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:54,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:54,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 14:28:54,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:54,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:54,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:54,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:54,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:54,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:28:54,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:54,998 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:28:54,999 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.24 stem predicates 2 loop predicates [2025-02-08 14:28:54,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 560 states and 701 transitions. cyclomatic complexity: 164 Second operand has 26 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 14:28:55,674 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 560 states and 701 transitions. cyclomatic complexity: 164. Second operand has 26 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 595 states and 743 transitions. Complement of second has 36 states. [2025-02-08 14:28:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 18 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-08 14:28:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 14:28:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2025-02-08 14:28:55,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 32 transitions. Stem has 74 letters. Loop has 7 letters. [2025-02-08 14:28:55,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:55,675 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-08 14:28:55,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:55,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 14:28:55,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 14:28:55,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:55,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:55,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 14:28:55,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:56,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:56,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:56,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:56,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:56,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:28:56,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:56,845 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:28:56,845 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.24 stem predicates 2 loop predicates [2025-02-08 14:28:56,846 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 560 states and 701 transitions. cyclomatic complexity: 164 Second operand has 26 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 14:28:58,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 560 states and 701 transitions. cyclomatic complexity: 164. Second operand has 26 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 1701 states and 2121 transitions. Complement of second has 73 states. [2025-02-08 14:28:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 26 stem states 1 non-accepting loop states 2 accepting loop states [2025-02-08 14:28:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 14:28:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 151 transitions. [2025-02-08 14:28:58,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 151 transitions. Stem has 74 letters. Loop has 7 letters. [2025-02-08 14:28:58,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:58,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 151 transitions. Stem has 81 letters. Loop has 7 letters. [2025-02-08 14:28:58,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:58,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 151 transitions. Stem has 74 letters. Loop has 14 letters. [2025-02-08 14:28:58,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-08 14:28:58,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1701 states and 2121 transitions. [2025-02-08 14:28:58,111 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 196 [2025-02-08 14:28:58,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1701 states to 850 states and 1028 transitions. [2025-02-08 14:28:58,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 693 [2025-02-08 14:28:58,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 783 [2025-02-08 14:28:58,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 850 states and 1028 transitions. [2025-02-08 14:28:58,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:58,114 INFO L218 hiAutomatonCegarLoop]: Abstraction has 850 states and 1028 transitions. [2025-02-08 14:28:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states and 1028 transitions. [2025-02-08 14:28:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 666. [2025-02-08 14:28:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 602 states have (on average 1.191029900332226) internal successors, (717), 601 states have internal predecessors, (717), 35 states have call successors, (37), 31 states have call predecessors, (37), 29 states have return successors, (53), 33 states have call predecessors, (53), 31 states have call successors, (53) [2025-02-08 14:28:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 807 transitions. [2025-02-08 14:28:58,121 INFO L240 hiAutomatonCegarLoop]: Abstraction has 666 states and 807 transitions. [2025-02-08 14:28:58,121 INFO L432 stractBuchiCegarLoop]: Abstraction has 666 states and 807 transitions. [2025-02-08 14:28:58,121 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-02-08 14:28:58,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 666 states and 807 transitions. [2025-02-08 14:28:58,123 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 131 [2025-02-08 14:28:58,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:58,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:58,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:58,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:58,123 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:58,123 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:58,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:58,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1245693855, now seen corresponding path program 2 times [2025-02-08 14:28:58,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:58,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674267653] [2025-02-08 14:28:58,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:58,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:58,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-08 14:28:58,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 14:28:58,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:58,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 14:28:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674267653] [2025-02-08 14:28:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674267653] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147312046] [2025-02-08 14:28:58,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:28:58,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:58,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:58,402 INFO L229 MonitoredProcess]: Starting monitored process 228 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:28:58,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (228)] Waiting until timeout for monitored process [2025-02-08 14:28:58,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-08 14:28:58,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 14:28:58,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:28:58,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:58,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 14:28:58,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 14:28:58,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:28:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 14:28:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147312046] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:28:58,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:28:58,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2025-02-08 14:28:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964187523] [2025-02-08 14:28:58,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:28:58,759 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:28:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1084734416, now seen corresponding path program 3 times [2025-02-08 14:28:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:58,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390598596] [2025-02-08 14:28:58,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:58,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:58,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:58,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:28:58,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:58,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:58,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:58,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:58,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:58,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:58,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:58,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:28:58,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 14:28:58,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-02-08 14:28:58,911 INFO L87 Difference]: Start difference. First operand 666 states and 807 transitions. cyclomatic complexity: 168 Second operand has 21 states, 16 states have (on average 2.75) internal successors, (44), 19 states have internal predecessors, (44), 6 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 14:28:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:28:59,069 INFO L93 Difference]: Finished difference Result 792 states and 948 transitions. [2025-02-08 14:28:59,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 792 states and 948 transitions. [2025-02-08 14:28:59,071 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 155 [2025-02-08 14:28:59,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 792 states to 748 states and 900 transitions. [2025-02-08 14:28:59,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 699 [2025-02-08 14:28:59,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 699 [2025-02-08 14:28:59,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 748 states and 900 transitions. [2025-02-08 14:28:59,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:28:59,074 INFO L218 hiAutomatonCegarLoop]: Abstraction has 748 states and 900 transitions. [2025-02-08 14:28:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states and 900 transitions. [2025-02-08 14:28:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 714. [2025-02-08 14:28:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 643 states have (on average 1.1850699844479005) internal successors, (762), 643 states have internal predecessors, (762), 39 states have call successors, (41), 35 states have call predecessors, (41), 32 states have return successors, (56), 35 states have call predecessors, (56), 34 states have call successors, (56) [2025-02-08 14:28:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 859 transitions. [2025-02-08 14:28:59,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 714 states and 859 transitions. [2025-02-08 14:28:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 14:28:59,080 INFO L432 stractBuchiCegarLoop]: Abstraction has 714 states and 859 transitions. [2025-02-08 14:28:59,081 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-02-08 14:28:59,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 714 states and 859 transitions. [2025-02-08 14:28:59,082 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 131 [2025-02-08 14:28:59,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:28:59,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:28:59,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:59,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:28:59,083 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:59,083 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" [2025-02-08 14:28:59,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1749073466, now seen corresponding path program 3 times [2025-02-08 14:28:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:59,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375276571] [2025-02-08 14:28:59,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:28:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:59,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 6 equivalence classes. [2025-02-08 14:28:59,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 14:28:59,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-08 14:28:59,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:59,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:59,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 14:28:59,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 14:28:59,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:59,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:59,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:59,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1084734416, now seen corresponding path program 4 times [2025-02-08 14:28:59,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:59,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284538290] [2025-02-08 14:28:59,143 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:59,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:59,146 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-02-08 14:28:59,147 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:28:59,147 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:59,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:28:59,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:28:59,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:28:59,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:28:59,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:28:59,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:28:59,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:28:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash -813120553, now seen corresponding path program 4 times [2025-02-08 14:28:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:28:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208381358] [2025-02-08 14:28:59,150 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:28:59,158 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-02-08 14:28:59,173 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 14:28:59,174 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:59,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 24 proven. 63 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 14:28:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:28:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208381358] [2025-02-08 14:28:59,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208381358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:28:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832043963] [2025-02-08 14:28:59,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:28:59,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:28:59,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:28:59,507 INFO L229 MonitoredProcess]: Starting monitored process 229 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:28:59,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (229)] Waiting until timeout for monitored process [2025-02-08 14:28:59,656 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-02-08 14:28:59,832 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 14:28:59,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:28:59,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:28:59,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 14:28:59,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:28:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-08 14:28:59,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:29:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-08 14:29:00,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832043963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:29:00,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:29:00,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 8] total 28 [2025-02-08 14:29:00,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467211958] [2025-02-08 14:29:00,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:29:00,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:00,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 14:29:00,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-02-08 14:29:00,189 INFO L87 Difference]: Start difference. First operand 714 states and 859 transitions. cyclomatic complexity: 173 Second operand has 28 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 7 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-08 14:29:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:00,820 INFO L93 Difference]: Finished difference Result 913 states and 1088 transitions. [2025-02-08 14:29:00,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 1088 transitions. [2025-02-08 14:29:00,824 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 178 [2025-02-08 14:29:00,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 881 states and 1055 transitions. [2025-02-08 14:29:00,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 817 [2025-02-08 14:29:00,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 823 [2025-02-08 14:29:00,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 881 states and 1055 transitions. [2025-02-08 14:29:00,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:29:00,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 881 states and 1055 transitions. [2025-02-08 14:29:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states and 1055 transitions. [2025-02-08 14:29:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 682. [2025-02-08 14:29:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 607 states have (on average 1.1515650741350907) internal successors, (699), 609 states have internal predecessors, (699), 41 states have call successors, (44), 37 states have call predecessors, (44), 34 states have return successors, (64), 35 states have call predecessors, (64), 36 states have call successors, (64) [2025-02-08 14:29:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 807 transitions. [2025-02-08 14:29:00,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 682 states and 807 transitions. [2025-02-08 14:29:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 14:29:00,840 INFO L432 stractBuchiCegarLoop]: Abstraction has 682 states and 807 transitions. [2025-02-08 14:29:00,840 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-02-08 14:29:00,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 682 states and 807 transitions. [2025-02-08 14:29:00,842 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 115 [2025-02-08 14:29:00,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:00,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:00,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:29:00,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:29:00,843 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" [2025-02-08 14:29:00,844 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" [2025-02-08 14:29:00,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:00,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1641926542, now seen corresponding path program 13 times [2025-02-08 14:29:00,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:00,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698495277] [2025-02-08 14:29:00,844 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:29:00,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:00,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 14:29:00,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 14:29:00,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:00,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:00,881 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:00,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 14:29:00,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 14:29:00,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:00,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:00,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:00,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:00,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2031404667, now seen corresponding path program 8 times [2025-02-08 14:29:00,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:00,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369538493] [2025-02-08 14:29:00,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:29:00,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:00,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:29:00,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:29:00,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:29:00,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:00,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:00,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:29:00,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:29:00,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:00,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:00,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:00,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash 827840500, now seen corresponding path program 14 times [2025-02-08 14:29:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:00,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848832169] [2025-02-08 14:29:00,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:29:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:00,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 14:29:00,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 14:29:00,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:29:00,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 14:29:01,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848832169] [2025-02-08 14:29:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848832169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:29:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760766365] [2025-02-08 14:29:01,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:29:01,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:29:01,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:01,654 INFO L229 MonitoredProcess]: Starting monitored process 230 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:29:01,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (230)] Waiting until timeout for monitored process [2025-02-08 14:29:01,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 14:29:01,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 14:29:01,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:29:01,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:01,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 14:29:01,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 18 proven. 43 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-08 14:29:01,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:29:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 18 proven. 43 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-08 14:29:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760766365] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:29:02,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:29:02,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 27 [2025-02-08 14:29:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874634977] [2025-02-08 14:29:02,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:29:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:02,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 14:29:02,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2025-02-08 14:29:02,258 INFO L87 Difference]: Start difference. First operand 682 states and 807 transitions. cyclomatic complexity: 156 Second operand has 28 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 24 states have internal predecessors, (62), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-08 14:29:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:02,869 INFO L93 Difference]: Finished difference Result 840 states and 985 transitions. [2025-02-08 14:29:02,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 840 states and 985 transitions. [2025-02-08 14:29:02,871 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 123 [2025-02-08 14:29:02,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 840 states to 840 states and 983 transitions. [2025-02-08 14:29:02,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 774 [2025-02-08 14:29:02,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 774 [2025-02-08 14:29:02,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 840 states and 983 transitions. [2025-02-08 14:29:02,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:29:02,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 840 states and 983 transitions. [2025-02-08 14:29:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states and 983 transitions. [2025-02-08 14:29:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 745. [2025-02-08 14:29:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 668 states have (on average 1.1377245508982037) internal successors, (760), 669 states have internal predecessors, (760), 42 states have call successors, (44), 37 states have call predecessors, (44), 35 states have return successors, (64), 38 states have call predecessors, (64), 37 states have call successors, (64) [2025-02-08 14:29:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 868 transitions. [2025-02-08 14:29:02,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 745 states and 868 transitions. [2025-02-08 14:29:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 14:29:02,890 INFO L432 stractBuchiCegarLoop]: Abstraction has 745 states and 868 transitions. [2025-02-08 14:29:02,890 INFO L338 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-02-08 14:29:02,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 745 states and 868 transitions. [2025-02-08 14:29:02,892 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 95 [2025-02-08 14:29:02,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:02,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:02,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:29:02,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:29:02,892 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" [2025-02-08 14:29:02,892 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" [2025-02-08 14:29:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1196822655, now seen corresponding path program 15 times [2025-02-08 14:29:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174615986] [2025-02-08 14:29:02,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:29:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:02,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 8 equivalence classes. [2025-02-08 14:29:02,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 75 statements. [2025-02-08 14:29:02,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 14:29:02,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 83 proven. 28 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-08 14:29:03,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:29:03,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174615986] [2025-02-08 14:29:03,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174615986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:29:03,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428332996] [2025-02-08 14:29:03,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:29:03,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:29:03,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:29:03,268 INFO L229 MonitoredProcess]: Starting monitored process 231 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:29:03,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (231)] Waiting until timeout for monitored process [2025-02-08 14:29:03,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 8 equivalence classes. [2025-02-08 14:29:03,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 50 of 75 statements. [2025-02-08 14:29:03,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 14:29:03,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:29:03,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 14:29:03,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:29:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 71 proven. 25 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 14:29:03,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:29:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 71 proven. 25 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-08 14:29:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428332996] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:29:03,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:29:03,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 29 [2025-02-08 14:29:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774474025] [2025-02-08 14:29:03,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:29:03,933 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-08 14:29:03,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1345531790, now seen corresponding path program 5 times [2025-02-08 14:29:03,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:03,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055889176] [2025-02-08 14:29:03,933 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:29:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:03,938 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:29:03,939 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:29:03,939 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:29:03,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:03,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:03,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:29:03,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:29:03,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:03,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:03,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:04,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:29:04,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 14:29:04,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-02-08 14:29:04,121 INFO L87 Difference]: Start difference. First operand 745 states and 868 transitions. cyclomatic complexity: 155 Second operand has 29 states, 25 states have (on average 3.24) internal successors, (81), 27 states have internal predecessors, (81), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-08 14:29:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:29:04,594 INFO L93 Difference]: Finished difference Result 1346 states and 1602 transitions. [2025-02-08 14:29:04,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1346 states and 1602 transitions. [2025-02-08 14:29:04,599 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 191 [2025-02-08 14:29:04,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1346 states to 1317 states and 1570 transitions. [2025-02-08 14:29:04,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1241 [2025-02-08 14:29:04,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1241 [2025-02-08 14:29:04,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1317 states and 1570 transitions. [2025-02-08 14:29:04,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-08 14:29:04,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1317 states and 1570 transitions. [2025-02-08 14:29:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states and 1570 transitions. [2025-02-08 14:29:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 728. [2025-02-08 14:29:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 651 states have (on average 1.141321044546851) internal successors, (743), 654 states have internal predecessors, (743), 41 states have call successors, (43), 37 states have call predecessors, (43), 36 states have return successors, (72), 36 states have call predecessors, (72), 36 states have call successors, (72) [2025-02-08 14:29:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 858 transitions. [2025-02-08 14:29:04,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 728 states and 858 transitions. [2025-02-08 14:29:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 14:29:04,611 INFO L432 stractBuchiCegarLoop]: Abstraction has 728 states and 858 transitions. [2025-02-08 14:29:04,611 INFO L338 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2025-02-08 14:29:04,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 728 states and 858 transitions. [2025-02-08 14:29:04,612 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 95 [2025-02-08 14:29:04,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:29:04,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:29:04,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:29:04,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:29:04,613 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~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;" "assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume main_~i~1#1 < main_~n~0#1;havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1;" "assume !(main_~i~1#1 < main_~n~0#1);havoc main_~i~1#1;" "call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2);" "call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#36#return;" "call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);"< "~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;" "assume ~n#1 < 2;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume !(merge_~k~0#1 < merge_~n#1);merge_~i~0#1 := 0;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume merge_~i~0#1 < merge_~n#1;call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1;" "assume !(merge_~i~0#1 < merge_~n#1);call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset);havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true;" "assume true;" >"#34#return;" "assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" "assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" [2025-02-08 14:29:04,613 INFO L754 eck$LassoCheckResult]: Loop: "assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1;" "merge_#t~ite13#1 := merge_#t~ite12#1;" "merge_#t~ite14#1 := merge_#t~ite13#1;" "call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1;" "assume merge_~k~0#1 < merge_~n#1;" "assume !(merge_~j~0#1 == merge_~n#1);" "assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);" [2025-02-08 14:29:04,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1106419398, now seen corresponding path program 16 times [2025-02-08 14:29:04,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:04,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40607701] [2025-02-08 14:29:04,614 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:29:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:04,624 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 81 statements into 2 equivalence classes. [2025-02-08 14:29:04,657 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 14:29:04,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:29:04,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:04,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:04,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 14:29:04,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 14:29:04,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:04,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:04,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:04,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1345531790, now seen corresponding path program 6 times [2025-02-08 14:29:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934101515] [2025-02-08 14:29:04,686 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:29:04,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:04,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:29:04,690 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:29:04,690 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:29:04,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:04,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:04,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:29:04,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:29:04,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:04,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:04,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:29:04,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:29:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1140480297, now seen corresponding path program 5 times [2025-02-08 14:29:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:29:04,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395775629] [2025-02-08 14:29:04,694 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:29:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:29:04,704 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 88 statements into 8 equivalence classes. [2025-02-08 14:29:04,748 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 14:29:04,749 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-08 14:29:04,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:04,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:29:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 14:29:04,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 14:29:04,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:29:04,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:29:04,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace