./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 c00e63dc 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-?-c00e63d-m [2025-02-06 19:08:37,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:08:38,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 19:08:38,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:08:38,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:08:38,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:08:38,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:08:38,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:08:38,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:08:38,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:08:38,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:08:38,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:08:38,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:08:38,076 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:08:38,076 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:08:38,076 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:08:38,076 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:08:38,076 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:08:38,076 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:08:38,076 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:08:38,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:08:38,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:08:38,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:08:38,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:08:38,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:08:38,077 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:08:38,078 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-06 19:08:38,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:08:38,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:08:38,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:08:38,280 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:08:38,280 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:08:38,281 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-06 19:08:39,348 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfd2f632f/075795ffa05c428db598a26266af8db4/FLAG457528252 [2025-02-06 19:08:39,557 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:08:39,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2025-02-06 19:08:39,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfd2f632f/075795ffa05c428db598a26266af8db4/FLAG457528252 [2025-02-06 19:08:39,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dfd2f632f/075795ffa05c428db598a26266af8db4 [2025-02-06 19:08:39,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:08:39,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:08:39,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:08:39,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:08:39,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:08:39,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:08:39" (1/1) ... [2025-02-06 19:08:39,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:39, skipping insertion in model container [2025-02-06 19:08:39,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:08:39" (1/1) ... [2025-02-06 19:08:39,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:08:40,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:08:40,059 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:08:40,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:08:40,092 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:08:40,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40 WrapperNode [2025-02-06 19:08:40,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:08:40,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:08:40,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:08:40,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:08:40,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,121 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2025-02-06 19:08:40,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:08:40,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:08:40,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:08:40,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:08:40,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,140 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-06 19:08:40,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:08:40,159 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:08:40,159 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:08:40,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:08:40,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (1/1) ... [2025-02-06 19:08:40,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:40,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:40,195 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-06 19:08:40,202 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-06 19:08:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:08:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:08:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2025-02-06 19:08:40,223 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2025-02-06 19:08:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 19:08:40,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:08:40,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:08:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:08:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:08:40,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:08:40,277 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:08:40,278 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:08:40,430 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-06 19:08:40,430 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:08:40,436 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:08:40,437 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:08:40,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:40 BoogieIcfgContainer [2025-02-06 19:08:40,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:08:40,438 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:08:40,438 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:08:40,442 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:08:40,442 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:40,442 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:08:39" (1/3) ... [2025-02-06 19:08:40,443 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@518abca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:08:40, skipping insertion in model container [2025-02-06 19:08:40,443 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:40,443 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:08:40" (2/3) ... [2025-02-06 19:08:40,443 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@518abca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:08:40, skipping insertion in model container [2025-02-06 19:08:40,443 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:08:40,443 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:08:40" (3/3) ... [2025-02-06 19:08:40,444 INFO L363 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2025-02-06 19:08:40,479 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:08:40,479 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:08:40,480 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:08:40,480 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:08:40,480 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:08:40,481 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:08:40,481 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:08:40,481 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:08:40,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-06 19:08:40,503 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-02-06 19:08:40,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:40,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:40,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:08:40,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:08:40,510 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:08:40,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-06 19:08:40,511 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-02-06 19:08:40,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:40,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:40,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:08:40,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:08:40,517 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-06 19:08:40,518 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-06 19:08:40,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 63520, now seen corresponding path program 1 times [2025-02-06 19:08:40,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650893333] [2025-02-06 19:08:40,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:40,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:40,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:40,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:40,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:40,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:40,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:40,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:40,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:40,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:40,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:40,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2025-02-06 19:08:40,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156695853] [2025-02-06 19:08:40,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:40,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:40,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:40,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:40,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:40,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:40,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:40,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:40,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:40,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:40,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:40,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1969147, now seen corresponding path program 1 times [2025-02-06 19:08:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:40,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853518776] [2025-02-06 19:08:40,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:40,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:40,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:40,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:40,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:40,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:40,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:08:40,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:08:40,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:40,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:40,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:40,848 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:40,848 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:40,848 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:40,849 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:40,849 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:40,849 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:40,849 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:40,849 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:40,849 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2025-02-06 19:08:40,849 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:40,849 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:40,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:40,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:40,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:40,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:40,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:40,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:40,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:41,144 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:41,146 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:41,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:41,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:41,149 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-06 19:08:41,157 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-06 19:08:41,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:41,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:41,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:41,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:41,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:41,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:41,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:41,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:41,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:41,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:41,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:41,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:41,184 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-06 19:08:41,186 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-06 19:08:41,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:41,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:41,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:41,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:41,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:41,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:41,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:41,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:41,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:41,208 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-06 19:08:41,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:41,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:41,210 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-06 19:08:41,212 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-06 19:08:41,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:41,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:41,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:41,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:41,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:41,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:41,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:41,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:41,228 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:41,234 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-06 19:08:41,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:41,239 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-06 19:08:41,241 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-06 19:08:41,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:41,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:41,255 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:08:41,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:41,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:41,260 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:08:41,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:41,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:41,276 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-06 19:08:41,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:41,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:41,279 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-06 19:08:41,282 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-06 19:08:41,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:41,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:41,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:41,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:41,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:41,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:41,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:41,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:41,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 19:08:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:41,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:41,305 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-06 19:08:41,307 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-06 19:08:41,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:41,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:41,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:41,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:41,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:41,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:41,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:41,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:41,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 19:08:41,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:41,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:41,336 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-06 19:08:41,338 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-06 19:08:41,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:41,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:41,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:41,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:41,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:41,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:41,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:41,362 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:41,380 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-02-06 19:08:41,382 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-02-06 19:08:41,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:41,386 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-06 19:08:41,388 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-06 19:08:41,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:41,401 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:08:41,401 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:41,401 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-06 19:08:41,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 19:08:41,416 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-02-06 19:08:41,422 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:08:41,423 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:08:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:41,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:41,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:41,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:08:41,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:41,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:41,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:41,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:41,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:08:41,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:41,484 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-06 19:08:41,506 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-06 19:08:41,508 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-06 19:08:41,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 29 states and 38 transitions. Complement of second has 3 states. [2025-02-06 19:08:41,554 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-06 19:08:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-06 19:08:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2025-02-06 19:08:41,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-06 19:08:41,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:41,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2025-02-06 19:08:41,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:41,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-06 19:08:41,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:41,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2025-02-06 19:08:41,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:08:41,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2025-02-06 19:08:41,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2025-02-06 19:08:41,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:08:41,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2025-02-06 19:08:41,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:41,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-02-06 19:08:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2025-02-06 19:08:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-06 19:08:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-06 19:08:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2025-02-06 19:08:41,596 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-02-06 19:08:41,596 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-02-06 19:08:41,597 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:08:41,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2025-02-06 19:08:41,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:08:41,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:41,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:41,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-06 19:08:41,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:08:41,599 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-06 19:08:41,599 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-06 19:08:41,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 61043566, now seen corresponding path program 1 times [2025-02-06 19:08:41,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:41,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108349759] [2025-02-06 19:08:41,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:41,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 19:08:41,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 19:08:41,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:41,679 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-06 19:08:41,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:41,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108349759] [2025-02-06 19:08:41,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108349759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:41,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:41,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:08:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667818216] [2025-02-06 19:08:41,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:41,685 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:41,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 50630, now seen corresponding path program 1 times [2025-02-06 19:08:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:41,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779818725] [2025-02-06 19:08:41,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:41,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:41,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:41,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:41,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:41,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:41,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:41,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:08:41,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:08:41,854 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-06 19:08:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:41,863 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2025-02-06 19:08:41,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2025-02-06 19:08:41,865 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:08:41,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2025-02-06 19:08:41,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:08:41,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:08:41,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2025-02-06 19:08:41,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:41,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-06 19:08:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2025-02-06 19:08:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-06 19:08:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) 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, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 19:08:41,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-02-06 19:08:41,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-06 19:08:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:08:41,870 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-06 19:08:41,870 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:08:41,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2025-02-06 19:08:41,870 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:08:41,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:41,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:41,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-06 19:08:41,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:08:41,871 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-06 19:08:41,871 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-06 19:08:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1892351113, now seen corresponding path program 1 times [2025-02-06 19:08:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912784123] [2025-02-06 19:08:41,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:41,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:08:41,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:08:41,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:41,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 19:08:41,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 19:08:41,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:41,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 50630, now seen corresponding path program 2 times [2025-02-06 19:08:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:41,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322039021] [2025-02-06 19:08:41,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:41,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:41,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:41,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:41,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:41,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:41,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:41,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:41,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:41,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:41,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:41,915 INFO L85 PathProgramCache]: Analyzing trace with hash -708699074, now seen corresponding path program 1 times [2025-02-06 19:08:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:41,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695379407] [2025-02-06 19:08:41,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:41,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:41,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:08:41,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:08:41,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:41,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:42,011 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-06 19:08:42,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695379407] [2025-02-06 19:08:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695379407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654695284] [2025-02-06 19:08:42,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:42,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:42,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:42,015 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-06 19:08:42,016 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-06 19:08:42,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:08:42,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:08:42,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:42,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:42,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:08:42,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:42,075 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-06 19:08:42,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:42,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:42,135 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-06 19:08:42,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654695284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:42,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:42,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-06 19:08:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982625145] [2025-02-06 19:08:42,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:42,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:42,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:08:42,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:08:42,291 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-06 19:08:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:42,339 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-02-06 19:08:42,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2025-02-06 19:08:42,340 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:08:42,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 31 transitions. [2025-02-06 19:08:42,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2025-02-06 19:08:42,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-02-06 19:08:42,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2025-02-06 19:08:42,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:08:42,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-06 19:08:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2025-02-06 19:08:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-06 19:08:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-06 19:08:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-06 19:08:42,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-06 19:08:42,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:08:42,343 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-06 19:08:42,343 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:08:42,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2025-02-06 19:08:42,343 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:08:42,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:42,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:42,344 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2025-02-06 19:08:42,344 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:08:42,344 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-06 19:08:42,344 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-06 19:08:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1466657074, now seen corresponding path program 2 times [2025-02-06 19:08:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:42,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112401967] [2025-02-06 19:08:42,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:42,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:42,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:08:42,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:42,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:42,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:42,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:42,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:42,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:42,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:42,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:42,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:42,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash 50630, now seen corresponding path program 3 times [2025-02-06 19:08:42,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:42,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982421067] [2025-02-06 19:08:42,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:42,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:42,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:42,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:42,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:08:42,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:42,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:42,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:42,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:42,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:42,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:42,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:42,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash -478568487, now seen corresponding path program 2 times [2025-02-06 19:08:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:42,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965046856] [2025-02-06 19:08:42,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:42,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-06 19:08:42,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:08:42,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:42,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:42,402 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:42,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 19:08:42,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 19:08:42,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:42,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:42,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:42,854 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:42,855 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:42,855 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:42,855 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:42,855 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:42,855 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:42,855 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:42,855 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:42,855 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2025-02-06 19:08:42,855 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:42,855 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:42,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:42,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:43,239 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:43,239 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:43,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,241 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-06 19:08:43,244 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-06 19:08:43,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,264 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-06 19:08:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,266 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-06 19:08:43,266 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-06 19:08:43,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 19:08:43,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,289 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-06 19:08:43,290 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-06 19:08:43,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,308 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-06 19:08:43,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,310 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-06 19:08:43,311 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-06 19:08:43,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 19:08:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,331 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-06 19:08:43,333 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-06 19:08:43,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-06 19:08:43,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,352 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-06 19:08:43,353 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-06 19:08:43,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:08:43,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,372 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-06 19:08:43,373 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-06 19:08:43,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,390 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-06 19:08:43,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,392 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-06 19:08:43,393 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-06 19:08:43,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,410 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-06 19:08:43,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,412 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-06 19:08:43,414 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-06 19:08:43,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-06 19:08:43,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,431 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-06 19:08:43,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,433 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-06 19:08:43,435 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-06 19:08:43,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,453 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-06 19:08:43,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,455 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-06 19:08:43,456 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-06 19:08:43,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:43,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,474 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-06 19:08:43,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,477 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-06 19:08:43,478 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-06 19:08:43,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:43,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:43,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:43,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 19:08:43,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,501 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-06 19:08:43,503 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-06 19:08:43,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:43,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,527 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-06 19:08:43,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,530 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-06 19:08:43,532 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-06 19:08:43,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,554 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-06 19:08:43,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,557 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-06 19:08:43,561 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-06 19:08:43,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:08:43,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,586 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-06 19:08:43,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,590 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-06 19:08:43,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:43,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,612 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-06 19:08:43,613 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-06 19:08:43,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:43,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,639 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-06 19:08:43,641 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-06 19:08:43,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,660 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-06 19:08:43,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,662 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-06 19:08:43,663 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-06 19:08:43,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:43,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-06 19:08:43,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,685 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-06 19:08:43,686 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-06 19:08:43,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:43,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,704 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-06 19:08:43,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,706 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-06 19:08:43,706 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-06 19:08:43,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:43,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,725 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-06 19:08:43,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,727 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-06 19:08:43,730 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-06 19:08:43,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,748 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-06 19:08:43,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,750 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-06 19:08:43,751 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-06 19:08:43,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-06 19:08:43,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,768 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-06 19:08:43,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,770 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-06 19:08:43,770 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-06 19:08:43,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,788 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-06 19:08:43,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,790 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-06 19:08:43,790 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-06 19:08:43,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:43,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,808 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-06 19:08:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,809 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-06 19:08:43,810 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-06 19:08:43,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-02-06 19:08:43,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,837 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-06 19:08:43,841 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-06 19:08:43,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:43,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:43,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:43,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:43,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:43,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-02-06 19:08:43,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,862 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-06 19:08:43,873 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-06 19:08:43,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:43,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:43,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:43,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:43,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:43,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:43,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:43,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:43,897 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-02-06 19:08:43,897 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-02-06 19:08:43,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:43,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:43,900 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-06 19:08:43,901 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-06 19:08:43,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:43,913 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:43,913 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:43,913 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-06 19:08:43,919 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-06 19:08:43,922 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-02-06 19:08:43,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:43,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:43,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:43,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:43,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:43,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:08:43,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:43,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:43,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:43,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:43,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:43,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:08:43,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:43,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-06 19:08:43,989 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-06 19:08:43,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-06 19:08:44,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 41 states and 53 transitions. Complement of second has 16 states. [2025-02-06 19:08:44,033 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-06 19:08:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-06 19:08:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2025-02-06 19:08:44,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-06 19:08:44,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:44,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 10 letters. Loop has 3 letters. [2025-02-06 19:08:44,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:44,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 7 letters. Loop has 6 letters. [2025-02-06 19:08:44,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:44,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2025-02-06 19:08:44,035 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:08:44,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 44 transitions. [2025-02-06 19:08:44,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-02-06 19:08:44,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-02-06 19:08:44,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2025-02-06 19:08:44,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:44,040 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-02-06 19:08:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2025-02-06 19:08:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-02-06 19:08:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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-06 19:08:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2025-02-06 19:08:44,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-02-06 19:08:44,042 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-02-06 19:08:44,042 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:08:44,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 40 transitions. [2025-02-06 19:08:44,044 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-02-06 19:08:44,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:44,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:44,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:44,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:44,048 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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;" >"#39#return;" [2025-02-06 19:08:44,048 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;" >"#39#return;" [2025-02-06 19:08:44,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1267588487, now seen corresponding path program 1 times [2025-02-06 19:08:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269420315] [2025-02-06 19:08:44,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:08:44,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:08:44,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:44,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:08:44,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:08:44,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:44,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1424763278, now seen corresponding path program 1 times [2025-02-06 19:08:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456964490] [2025-02-06 19:08:44,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:08:44,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:44,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:44,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:08:44,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:44,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:44,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash -918106632, now seen corresponding path program 1 times [2025-02-06 19:08:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128437181] [2025-02-06 19:08:44,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:44,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:44,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:44,337 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-06 19:08:44,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128437181] [2025-02-06 19:08:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128437181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316018970] [2025-02-06 19:08:44,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:44,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:44,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:44,340 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-06 19:08:44,340 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-06 19:08:44,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 19:08:44,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:44,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:44,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:08:44,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:44,434 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-06 19:08:44,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:44,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-02-06 19:08:44,532 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-06 19:08:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316018970] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:44,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:44,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2025-02-06 19:08:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052139373] [2025-02-06 19:08:44,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:44,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 19:08:44,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-06 19:08:44,860 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. cyclomatic complexity: 15 Second operand has 14 states, 10 states have (on average 2.0) internal successors, (20), 12 states have internal predecessors, (20), 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-06 19:08:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:44,953 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2025-02-06 19:08:44,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2025-02-06 19:08:44,954 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-02-06 19:08:44,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 53 states and 68 transitions. [2025-02-06 19:08:44,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-02-06 19:08:44,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2025-02-06 19:08:44,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 68 transitions. [2025-02-06 19:08:44,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:44,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-02-06 19:08:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 68 transitions. [2025-02-06 19:08:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-06 19:08:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-06 19:08:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2025-02-06 19:08:44,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-02-06 19:08:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 19:08:44,959 INFO L432 stractBuchiCegarLoop]: Abstraction has 53 states and 68 transitions. [2025-02-06 19:08:44,959 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:08:44,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 68 transitions. [2025-02-06 19:08:44,959 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-02-06 19:08:44,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:44,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:44,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:44,960 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:44,960 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;" >"#39#return;" [2025-02-06 19:08:44,960 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;" >"#39#return;" [2025-02-06 19:08:44,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,960 INFO L85 PathProgramCache]: Analyzing trace with hash -879795508, now seen corresponding path program 2 times [2025-02-06 19:08:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285407539] [2025-02-06 19:08:44,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-06 19:08:44,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:08:44,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:44,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:44,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:08:44,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:08:44,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:44,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1424763278, now seen corresponding path program 2 times [2025-02-06 19:08:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145168563] [2025-02-06 19:08:44,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 19:08:44,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:44,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:44,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,987 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:08:44,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:44,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:44,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:44,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:44,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1013268029, now seen corresponding path program 2 times [2025-02-06 19:08:44,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:44,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097622560] [2025-02-06 19:08:44,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:44,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-06 19:08:45,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:08:45,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:45,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:45,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:45,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:08:45,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:08:45,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:45,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:46,062 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:46,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:46,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:46,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:46,062 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:46,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,062 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:46,062 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:46,062 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2025-02-06 19:08:46,062 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:46,062 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:46,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:46,582 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:46,582 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:46,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,584 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-06 19:08:46,585 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-06 19:08:46,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,597 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-02-06 19:08:46,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,604 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-06 19:08:46,605 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-06 19:08:46,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:46,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-02-06 19:08:46,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,623 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-06 19:08:46,624 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-06 19:08:46,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,640 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-06 19:08:46,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,642 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-06 19:08:46,643 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-06 19:08:46,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-02-06 19:08:46,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,661 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-06 19:08:46,662 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-06 19:08:46,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:46,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-02-06 19:08:46,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,682 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-06 19:08:46,682 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-06 19:08:46,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:46,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,699 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-06 19:08:46,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,701 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-06 19:08:46,701 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-06 19:08:46,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-02-06 19:08:46,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,720 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-06 19:08:46,722 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-06 19:08:46,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,740 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-06 19:08:46,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,742 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-06 19:08:46,744 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-06 19:08:46,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-06 19:08:46,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,756 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,762 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-06 19:08:46,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,764 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-06 19:08:46,765 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-06 19:08:46,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,782 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-06 19:08:46,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,784 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-06 19:08:46,784 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-06 19:08:46,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,802 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-06 19:08:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,804 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-06 19:08:46,805 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-06 19:08:46,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:46,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,822 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-06 19:08:46,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,824 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-06 19:08:46,825 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-06 19:08:46,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-06 19:08:46,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-02-06 19:08:46,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,844 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-06 19:08:46,845 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-06 19:08:46,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-02-06 19:08:46,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,864 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-06 19:08:46,864 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-06 19:08:46,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,889 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-06 19:08:46,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,891 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-06 19:08:46,892 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-06 19:08:46,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:46,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,910 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-06 19:08:46,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,913 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-06 19:08:46,913 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-06 19:08:46,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-02-06 19:08:46,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,933 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-06 19:08:46,933 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-06 19:08:46,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:46,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-02-06 19:08:46,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,952 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-06 19:08:46,953 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-06 19:08:46,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:46,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,964 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-02-06 19:08:46,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,972 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-06 19:08:46,973 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-06 19:08:46,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:46,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:46,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:46,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:46,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:46,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:46,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:46,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:46,985 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:46,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-02-06 19:08:46,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:46,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:46,992 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-06 19:08:46,994 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-06 19:08:46,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:47,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:47,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,014 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-06 19:08:47,015 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-06 19:08:47,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-02-06 19:08:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,040 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-06 19:08:47,041 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-06 19:08:47,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:47,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,060 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-06 19:08:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,063 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-06 19:08:47,065 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-06 19:08:47,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:47,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:47,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,085 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-06 19:08:47,086 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-06 19:08:47,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-06 19:08:47,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:47,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,109 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-06 19:08:47,112 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-06 19:08:47,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:47,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,133 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-06 19:08:47,134 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-06 19:08:47,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-06 19:08:47,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,145 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,151 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-06 19:08:47,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,152 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-06 19:08:47,153 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-06 19:08:47,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:47,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,170 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-06 19:08:47,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,172 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-06 19:08:47,173 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-06 19:08:47,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:47,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-02-06 19:08:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,192 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-06 19:08:47,193 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-06 19:08:47,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,210 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-06 19:08:47,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,212 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-06 19:08:47,212 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-06 19:08:47,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:47,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-02-06 19:08:47,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,231 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-06 19:08:47,231 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-06 19:08:47,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-02-06 19:08:47,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,249 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-06 19:08:47,250 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-06 19:08:47,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:47,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,268 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-06 19:08:47,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,270 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-06 19:08:47,270 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-06 19:08:47,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-02-06 19:08:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,289 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-06 19:08:47,289 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-06 19:08:47,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:47,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,307 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-06 19:08:47,308 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-06 19:08:47,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-06 19:08:47,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,319 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-02-06 19:08:47,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,326 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-06 19:08:47,326 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-06 19:08:47,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-02-06 19:08:47,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,345 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-06 19:08:47,345 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-06 19:08:47,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:47,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:47,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:47,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,362 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-06 19:08:47,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,364 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-06 19:08:47,365 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-06 19:08:47,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-06 19:08:47,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:47,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:47,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:47,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,388 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-06 19:08:47,389 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-06 19:08:47,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:47,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,399 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-02-06 19:08:47,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,401 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-02-06 19:08:47,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:47,405 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:47,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-02-06 19:08:47,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,412 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-06 19:08:47,413 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-06 19:08:47,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-06 19:08:47,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:47,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:47,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:47,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:47,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:47,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:47,439 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:47,468 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-02-06 19:08:47,468 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 18 variables to zero. [2025-02-06 19:08:47,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:47,470 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-06 19:08:47,470 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-06 19:08:47,471 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:47,481 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-02-06 19:08:47,481 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:47,481 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~n#1) = 1*merge_sort_~n#1 Supporting invariants [-1*merge_sort_~n#1 + 2*merge_sort_~m~0#1 + 1 >= 0, 1*merge_sort_~m~0#1 >= 0] [2025-02-06 19:08:47,487 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-06 19:08:47,492 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2025-02-06 19:08:47,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:08:47,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:08:47,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:47,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:08:47,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:47,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 19:08:47,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 19:08:47,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:47,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 19:08:47,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:47,661 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-06 19:08:47,662 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-06 19:08:47,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 68 transitions. cyclomatic complexity: 22 Second operand has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-06 19:08:47,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 68 transitions. cyclomatic complexity: 22. Second operand has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 156 states and 215 transitions. Complement of second has 30 states. [2025-02-06 19:08:47,830 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-06 19:08:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-06 19:08:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2025-02-06 19:08:47,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 15 letters. Loop has 8 letters. [2025-02-06 19:08:47,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:47,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 23 letters. Loop has 8 letters. [2025-02-06 19:08:47,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:47,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 15 letters. Loop has 16 letters. [2025-02-06 19:08:47,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:47,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 215 transitions. [2025-02-06 19:08:47,837 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2025-02-06 19:08:47,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 143 states and 202 transitions. [2025-02-06 19:08:47,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2025-02-06 19:08:47,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-02-06 19:08:47,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 202 transitions. [2025-02-06 19:08:47,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:47,841 INFO L218 hiAutomatonCegarLoop]: Abstraction has 143 states and 202 transitions. [2025-02-06 19:08:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 202 transitions. [2025-02-06 19:08:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 131. [2025-02-06 19:08:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 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-06 19:08:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2025-02-06 19:08:47,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 180 transitions. [2025-02-06 19:08:47,851 INFO L432 stractBuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2025-02-06 19:08:47,851 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:08:47,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2025-02-06 19:08:47,852 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2025-02-06 19:08:47,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:47,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:47,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:47,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:08:47,853 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;" >"#39#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;" >"#37#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-06 19:08:47,853 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-06 19:08:47,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1828960763, now seen corresponding path program 1 times [2025-02-06 19:08:47,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231717751] [2025-02-06 19:08:47,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:47,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:47,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:08:47,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:47,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:47,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:08:47,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:47,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:47,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 42443, now seen corresponding path program 1 times [2025-02-06 19:08:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361337582] [2025-02-06 19:08:47,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:47,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:47,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:47,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:47,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:47,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:47,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:47,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:47,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:47,886 INFO L85 PathProgramCache]: Analyzing trace with hash -614960825, now seen corresponding path program 1 times [2025-02-06 19:08:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:47,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582975659] [2025-02-06 19:08:47,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:47,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:47,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 19:08:47,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 19:08:47,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:47,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:48,009 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-06 19:08:48,012 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-06 19:08:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:48,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582975659] [2025-02-06 19:08:48,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582975659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:48,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:48,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:08:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23624267] [2025-02-06 19:08:48,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:48,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:48,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:08:48,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:08:48,079 INFO L87 Difference]: Start difference. First operand 131 states and 180 transitions. cyclomatic complexity: 67 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-06 19:08:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:48,110 INFO L93 Difference]: Finished difference Result 167 states and 227 transitions. [2025-02-06 19:08:48,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 227 transitions. [2025-02-06 19:08:48,112 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 64 [2025-02-06 19:08:48,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 227 transitions. [2025-02-06 19:08:48,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-02-06 19:08:48,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2025-02-06 19:08:48,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 227 transitions. [2025-02-06 19:08:48,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:48,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167 states and 227 transitions. [2025-02-06 19:08:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 227 transitions. [2025-02-06 19:08:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2025-02-06 19:08:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 132 states have internal predecessors, (175), 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-06 19:08:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 216 transitions. [2025-02-06 19:08:48,121 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 216 transitions. [2025-02-06 19:08:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:08:48,121 INFO L432 stractBuchiCegarLoop]: Abstraction has 161 states and 216 transitions. [2025-02-06 19:08:48,122 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:08:48,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 216 transitions. [2025-02-06 19:08:48,123 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 60 [2025-02-06 19:08:48,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:48,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:48,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:48,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:48,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_~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;" >"#39#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;" >"#37#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-06 19:08:48,123 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-06 19:08:48,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1828960763, now seen corresponding path program 2 times [2025-02-06 19:08:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292843313] [2025-02-06 19:08:48,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-06 19:08:48,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:48,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:48,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:08:48,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:48,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash 749470631, now seen corresponding path program 1 times [2025-02-06 19:08:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107999919] [2025-02-06 19:08:48,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:48,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:48,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:48,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:48,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:48,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:48,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1208372957, now seen corresponding path program 1 times [2025-02-06 19:08:48,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:48,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906178120] [2025-02-06 19:08:48,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:48,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:48,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 19:08:48,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:08:48,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:48,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 19:08:48,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 19:08:48,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:48,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:48,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:49,207 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:49,207 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:49,207 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:49,207 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:49,207 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:49,207 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:49,207 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:49,207 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:49,207 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2025-02-06 19:08:49,207 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:49,207 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:49,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:49,970 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:49,970 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:49,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:49,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:49,972 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-06 19:08:49,973 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-06 19:08:49,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:49,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:49,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:49,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:49,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:49,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:49,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:49,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:49,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:49,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:49,995 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-06 19:08:49,995 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-06 19:08:49,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,014 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-06 19:08:50,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,016 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-06 19:08:50,017 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-06 19:08:50,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-02-06 19:08:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,037 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-06 19:08:50,038 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-06 19:08:50,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:50,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-02-06 19:08:50,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,058 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-06 19:08:50,059 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-06 19:08:50,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-02-06 19:08:50,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,078 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-06 19:08:50,079 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-06 19:08:50,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,097 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-06 19:08:50,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,099 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-06 19:08:50,100 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-06 19:08:50,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,118 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-06 19:08:50,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,121 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-06 19:08:50,121 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-06 19:08:50,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,139 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-06 19:08:50,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,141 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-06 19:08:50,143 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-06 19:08:50,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,159 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-06 19:08:50,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,161 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-06 19:08:50,162 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-06 19:08:50,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-06 19:08:50,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-02-06 19:08:50,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,182 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-06 19:08:50,183 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-06 19:08:50,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:50,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:50,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:50,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:50,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:50,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,203 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-06 19:08:50,204 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-06 19:08:50,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:50,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,224 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-06 19:08:50,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,226 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-06 19:08:50,226 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-06 19:08:50,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,239 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-02-06 19:08:50,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,242 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:08:50,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-02-06 19:08:50,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,256 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-06 19:08:50,257 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-06 19:08:50,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:50,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,276 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-06 19:08:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,278 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-06 19:08:50,279 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-06 19:08:50,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:50,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:50,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:50,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:50,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-02-06 19:08:50,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:50,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:50,301 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-06 19:08:50,303 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-06 19:08:50,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:50,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:50,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:50,315 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-02-06 19:08:50,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:50,359 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-02-06 19:08:50,359 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-02-06 19:08:50,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:51,397 INFO L443 ModelExtractionUtils]: Simplification made 57 calls to the SMT solver. [2025-02-06 19:08:51,397 INFO L444 ModelExtractionUtils]: 23 out of 100 variables were initially zero. Simplification set additionally 74 variables to zero. [2025-02-06 19:08:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:51,399 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-06 19:08:51,400 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-06 19:08:51,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:51,413 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-02-06 19:08:51,413 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:51,413 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~k~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~k~0#1 Supporting invariants [] [2025-02-06 19:08:51,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-02-06 19:08:51,436 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-02-06 19:08:51,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:08:51,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:08:51,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:51,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:08:51,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:51,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:51,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:51,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:51,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:08:51,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:51,574 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-06 19:08:51,574 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-06 19:08:51,574 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 161 states and 216 transitions. cyclomatic complexity: 73 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-06 19:08:51,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 161 states and 216 transitions. cyclomatic complexity: 73. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 354 states and 500 transitions. Complement of second has 10 states. [2025-02-06 19:08:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-02-06 19:08:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-06 19:08:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-02-06 19:08:51,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2025-02-06 19:08:51,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:51,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 27 letters. Loop has 7 letters. [2025-02-06 19:08:51,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:51,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 20 letters. Loop has 14 letters. [2025-02-06 19:08:51,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:51,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 500 transitions. [2025-02-06 19:08:51,628 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 52 [2025-02-06 19:08:51,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 284 states and 404 transitions. [2025-02-06 19:08:51,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2025-02-06 19:08:51,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2025-02-06 19:08:51,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 404 transitions. [2025-02-06 19:08:51,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:51,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 284 states and 404 transitions. [2025-02-06 19:08:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 404 transitions. [2025-02-06 19:08:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 229. [2025-02-06 19:08:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 189 states have (on average 1.343915343915344) internal successors, (254), 188 states have internal predecessors, (254), 26 states have call successors, (29), 18 states have call predecessors, (29), 14 states have return successors, (34), 22 states have call predecessors, (34), 24 states have call successors, (34) [2025-02-06 19:08:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 317 transitions. [2025-02-06 19:08:51,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 229 states and 317 transitions. [2025-02-06 19:08:51,652 INFO L432 stractBuchiCegarLoop]: Abstraction has 229 states and 317 transitions. [2025-02-06 19:08:51,652 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:08:51,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 317 transitions. [2025-02-06 19:08:51,656 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 52 [2025-02-06 19:08:51,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:51,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:51,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:51,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:08:51,657 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;" >"#39#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;" >"#37#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-06 19:08:51,657 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-06 19:08:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash -863208802, now seen corresponding path program 1 times [2025-02-06 19:08:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793745823] [2025-02-06 19:08:51,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 19:08:51,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 19:08:51,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:51,710 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-06 19:08:51,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:51,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793745823] [2025-02-06 19:08:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793745823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:51,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:51,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 19:08:51,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011597085] [2025-02-06 19:08:51,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:51,712 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:51,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,713 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 1 times [2025-02-06 19:08:51,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113651294] [2025-02-06 19:08:51,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:51,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:51,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:51,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:51,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:51,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:51,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:51,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:51,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:08:51,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:08:51,763 INFO L87 Difference]: Start difference. First operand 229 states and 317 transitions. cyclomatic complexity: 111 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-06 19:08:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:51,785 INFO L93 Difference]: Finished difference Result 315 states and 417 transitions. [2025-02-06 19:08:51,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 417 transitions. [2025-02-06 19:08:51,787 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 52 [2025-02-06 19:08:51,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 315 states and 417 transitions. [2025-02-06 19:08:51,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2025-02-06 19:08:51,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2025-02-06 19:08:51,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 315 states and 417 transitions. [2025-02-06 19:08:51,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:51,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 315 states and 417 transitions. [2025-02-06 19:08:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states and 417 transitions. [2025-02-06 19:08:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 234. [2025-02-06 19:08:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.3144329896907216) internal successors, (255), 193 states have internal predecessors, (255), 26 states have call successors, (29), 18 states have call predecessors, (29), 14 states have return successors, (34), 22 states have call predecessors, (34), 24 states have call successors, (34) [2025-02-06 19:08:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 318 transitions. [2025-02-06 19:08:51,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 234 states and 318 transitions. [2025-02-06 19:08:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:08:51,807 INFO L432 stractBuchiCegarLoop]: Abstraction has 234 states and 318 transitions. [2025-02-06 19:08:51,807 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:08:51,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 234 states and 318 transitions. [2025-02-06 19:08:51,808 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 52 [2025-02-06 19:08:51,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:51,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:51,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:51,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:08:51,809 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;" >"#39#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-06 19:08:51,809 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-06 19:08:51,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1972348792, now seen corresponding path program 3 times [2025-02-06 19:08:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167614315] [2025-02-06 19:08:51,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:51,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-02-06 19:08:51,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:51,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:08:51,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:51,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-02-06 19:08:52,128 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-06 19:08:52,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167614315] [2025-02-06 19:08:52,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167614315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751492715] [2025-02-06 19:08:52,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:52,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:52,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:52,133 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:52,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2025-02-06 19:08:52,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-02-06 19:08:52,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 19:08:52,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:08:52,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:52,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 19:08:52,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:52,288 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-06 19:08:52,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:52,432 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-06 19:08:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751492715] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:52,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:52,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2025-02-06 19:08:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244879365] [2025-02-06 19:08:52,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:52,433 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:52,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 50630, now seen corresponding path program 4 times [2025-02-06 19:08:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:52,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738663914] [2025-02-06 19:08:52,433 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:52,435 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-06 19:08:52,438 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:52,438 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:08:52,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:52,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:08:52,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:08:52,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:52,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:52,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 19:08:52,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-02-06 19:08:52,559 INFO L87 Difference]: Start difference. First operand 234 states and 318 transitions. cyclomatic complexity: 107 Second operand has 24 states, 17 states have (on average 1.588235294117647) internal successors, (27), 20 states have internal predecessors, (27), 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-06 19:08:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:52,779 INFO L93 Difference]: Finished difference Result 398 states and 532 transitions. [2025-02-06 19:08:52,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 532 transitions. [2025-02-06 19:08:52,782 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 91 [2025-02-06 19:08:52,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 391 states and 524 transitions. [2025-02-06 19:08:52,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2025-02-06 19:08:52,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2025-02-06 19:08:52,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 391 states and 524 transitions. [2025-02-06 19:08:52,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:52,787 INFO L218 hiAutomatonCegarLoop]: Abstraction has 391 states and 524 transitions. [2025-02-06 19:08:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states and 524 transitions. [2025-02-06 19:08:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 376. [2025-02-06 19:08:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 310 states have (on average 1.303225806451613) internal successors, (404), 308 states have internal predecessors, (404), 42 states have call successors, (48), 32 states have call predecessors, (48), 24 states have return successors, (52), 35 states have call predecessors, (52), 38 states have call successors, (52) [2025-02-06 19:08:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 504 transitions. [2025-02-06 19:08:52,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 376 states and 504 transitions. [2025-02-06 19:08:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 19:08:52,798 INFO L432 stractBuchiCegarLoop]: Abstraction has 376 states and 504 transitions. [2025-02-06 19:08:52,798 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:08:52,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 376 states and 504 transitions. [2025-02-06 19:08:52,800 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 90 [2025-02-06 19:08:52,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:52,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:52,801 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] [2025-02-06 19:08:52,801 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:08:52,801 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;" >"#39#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;" >"#37#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;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);merge_~i~0#1 := 0;" [2025-02-06 19:08:52,801 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-06 19:08:52,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2039107074, now seen corresponding path program 1 times [2025-02-06 19:08:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:52,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-02-06 19:08:52,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:52,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:52,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 19:08:52,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 19:08:52,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:52,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:52,907 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-06 19:08:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101989819] [2025-02-06 19:08:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101989819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:08:52,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:08:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 19:08:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319829311] [2025-02-06 19:08:52,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:08:52,907 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 2 times [2025-02-06 19:08:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537309244] [2025-02-06 19:08:52,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:52,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:52,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:52,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:52,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:52,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:52,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:52,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:52,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:52,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 19:08:52,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 19:08:52,986 INFO L87 Difference]: Start difference. First operand 376 states and 504 transitions. cyclomatic complexity: 158 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-06 19:08:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:53,008 INFO L93 Difference]: Finished difference Result 460 states and 616 transitions. [2025-02-06 19:08:53,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 616 transitions. [2025-02-06 19:08:53,012 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-06 19:08:53,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 460 states and 616 transitions. [2025-02-06 19:08:53,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2025-02-06 19:08:53,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2025-02-06 19:08:53,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 460 states and 616 transitions. [2025-02-06 19:08:53,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:53,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 460 states and 616 transitions. [2025-02-06 19:08:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states and 616 transitions. [2025-02-06 19:08:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-02-06 19:08:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 394 states have (on average 1.3096446700507614) internal successors, (516), 392 states have internal predecessors, (516), 42 states have call successors, (48), 32 states have call predecessors, (48), 24 states have return successors, (52), 35 states have call predecessors, (52), 38 states have call successors, (52) [2025-02-06 19:08:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 616 transitions. [2025-02-06 19:08:53,026 INFO L240 hiAutomatonCegarLoop]: Abstraction has 460 states and 616 transitions. [2025-02-06 19:08:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 19:08:53,027 INFO L432 stractBuchiCegarLoop]: Abstraction has 460 states and 616 transitions. [2025-02-06 19:08:53,027 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:08:53,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 460 states and 616 transitions. [2025-02-06 19:08:53,029 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-06 19:08:53,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:53,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:53,029 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, 1] [2025-02-06 19:08:53,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:08:53,029 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;" >"#39#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;" >"#37#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-06 19:08:53,029 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-06 19:08:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1194220479, now seen corresponding path program 1 times [2025-02-06 19:08:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:53,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134291215] [2025-02-06 19:08:53,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:53,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:08:53,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:08:53,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:53,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:53,111 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-06 19:08:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134291215] [2025-02-06 19:08:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134291215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478431604] [2025-02-06 19:08:53,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:53,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:53,114 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:53,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2025-02-06 19:08:53,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 19:08:53,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 19:08:53,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:53,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:53,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:08:53,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:53,204 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-06 19:08:53,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:53,238 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-06 19:08:53,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478431604] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:53,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:53,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 19:08:53,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43995505] [2025-02-06 19:08:53,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:53,240 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:53,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 3 times [2025-02-06 19:08:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006939517] [2025-02-06 19:08:53,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:08:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:53,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:53,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:53,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:08:53,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:53,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:53,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:53,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:53,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:53,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:53,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:53,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 19:08:53,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 19:08:53,285 INFO L87 Difference]: Start difference. First operand 460 states and 616 transitions. cyclomatic complexity: 186 Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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-06 19:08:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:53,313 INFO L93 Difference]: Finished difference Result 782 states and 994 transitions. [2025-02-06 19:08:53,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 782 states and 994 transitions. [2025-02-06 19:08:53,320 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-06 19:08:53,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 782 states to 782 states and 994 transitions. [2025-02-06 19:08:53,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2025-02-06 19:08:53,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2025-02-06 19:08:53,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 782 states and 994 transitions. [2025-02-06 19:08:53,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:53,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 782 states and 994 transitions. [2025-02-06 19:08:53,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states and 994 transitions. [2025-02-06 19:08:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 600. [2025-02-06 19:08:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 534 states have (on average 1.2546816479400749) internal successors, (670), 532 states have internal predecessors, (670), 42 states have call successors, (48), 32 states have call predecessors, (48), 24 states have return successors, (52), 35 states have call predecessors, (52), 38 states have call successors, (52) [2025-02-06 19:08:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 770 transitions. [2025-02-06 19:08:53,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 600 states and 770 transitions. [2025-02-06 19:08:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:08:53,342 INFO L432 stractBuchiCegarLoop]: Abstraction has 600 states and 770 transitions. [2025-02-06 19:08:53,342 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:08:53,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 600 states and 770 transitions. [2025-02-06 19:08:53,346 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-06 19:08:53,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:53,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:53,347 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, 1] [2025-02-06 19:08:53,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:08:53,347 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;" >"#39#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;" >"#37#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-06 19:08:53,347 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-06 19:08:53,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:53,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1808479963, now seen corresponding path program 1 times [2025-02-06 19:08:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296496848] [2025-02-06 19:08:53,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:53,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:08:53,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:08:53,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:53,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:53,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:53,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:08:53,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:08:53,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:53,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:53,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 4 times [2025-02-06 19:08:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087659013] [2025-02-06 19:08:53,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:08:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:53,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-06 19:08:53,384 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:53,384 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:08:53,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:53,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:53,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:53,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:53,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:53,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:53,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:53,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:53,387 INFO L85 PathProgramCache]: Analyzing trace with hash 228304007, now seen corresponding path program 1 times [2025-02-06 19:08:53,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:53,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609819172] [2025-02-06 19:08:53,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:53,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 19:08:53,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 19:08:53,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:53,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:53,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:53,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 19:08:53,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 19:08:53,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:53,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:53,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:55,020 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:08:55,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:08:55,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:08:55,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:08:55,021 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:08:55,021 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,021 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:08:55,021 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:08:55,021 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration13_Lasso [2025-02-06 19:08:55,021 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:08:55,021 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:08:55,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:08:55,921 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:08:55,921 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:08:55,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,923 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-06 19:08:55,923 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-06 19:08:55,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-06 19:08:55,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,940 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-06 19:08:55,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,942 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-06 19:08:55,943 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-06 19:08:55,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-06 19:08:55,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,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-06 19:08:55,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,961 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-06 19:08:55,962 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-06 19:08:55,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:55,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,974 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,979 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-06 19:08:55,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:55,981 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-06 19:08:55,982 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-06 19:08:55,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:55,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:55,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:55,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:55,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:55,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:55,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:55,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:55,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:55,999 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-06 19:08:55,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:55,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,000 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-06 19:08:56,001 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-06 19:08:56,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,020 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-06 19:08:56,020 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-06 19:08:56,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:56,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-02-06 19:08:56,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,039 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-06 19:08:56,040 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-06 19:08:56,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:56,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,056 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-06 19:08:56,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,058 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-06 19:08:56,059 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-06 19:08:56,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-02-06 19:08:56,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,077 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-06 19:08:56,078 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-06 19:08:56,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-06 19:08:56,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:56,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,096 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-06 19:08:56,097 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-06 19:08:56,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:56,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,115 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-06 19:08:56,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,117 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-06 19:08:56,117 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-06 19:08:56,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-02-06 19:08:56,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,136 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-06 19:08:56,136 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-06 19:08:56,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,155 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-06 19:08:56,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,157 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-06 19:08:56,157 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-06 19:08:56,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-06 19:08:56,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,169 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,169 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,175 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-06 19:08:56,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,177 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-06 19:08:56,178 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-06 19:08:56,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-06 19:08:56,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,191 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-02-06 19:08:56,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,198 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-06 19:08:56,199 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-06 19:08:56,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-06 19:08:56,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2025-02-06 19:08:56,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,220 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-06 19:08:56,221 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-06 19:08:56,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:08:56,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,256 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-06 19:08:56,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,258 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-06 19:08:56,260 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-06 19:08:56,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:08:56,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:08:56,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:08:56,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,278 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-06 19:08:56,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,280 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-06 19:08:56,282 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-06 19:08:56,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-06 19:08:56,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,302 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-06 19:08:56,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,304 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-06 19:08:56,305 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-06 19:08:56,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,326 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-06 19:08:56,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,328 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-06 19:08:56,329 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-06 19:08:56,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,342 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,342 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-02-06 19:08:56,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,353 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-06 19:08:56,355 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-06 19:08:56,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:56,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,378 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-06 19:08:56,380 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-06 19:08:56,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-02-06 19:08:56,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,404 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-06 19:08:56,405 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-06 19:08:56,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,425 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-06 19:08:56,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,428 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-06 19:08:56,429 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-06 19:08:56,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,441 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-02-06 19:08:56,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,444 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-02-06 19:08:56,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:08:56,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-02-06 19:08:56,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,457 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-06 19:08:56,457 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-06 19:08:56,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:08:56,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:08:56,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:08:56,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:08:56,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:08:56,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:08:56,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:08:56,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:08:56,500 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-02-06 19:08:56,500 INFO L444 ModelExtractionUtils]: 3 out of 31 variables were initially zero. Simplification set additionally 25 variables to zero. [2025-02-06 19:08:56,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:08:56,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,502 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-06 19:08:56,503 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-06 19:08:56,503 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:08:56,514 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:08:56,514 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:08:56,514 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~i~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~i~0#1 Supporting invariants [] [2025-02-06 19:08:56,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-02-06 19:08:56,553 INFO L156 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2025-02-06 19:08:56,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:56,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:08:56,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:08:56,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:56,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:08:56,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:56,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:08:56,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:08:56,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:56,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 19:08:56,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:56,673 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-06 19:08:56,673 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-06 19:08:56,674 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 600 states and 770 transitions. cyclomatic complexity: 200 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-06 19:08:56,707 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 600 states and 770 transitions. cyclomatic complexity: 200. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 754 states and 985 transitions. Complement of second has 6 states. [2025-02-06 19:08:56,709 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-06 19:08:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-06 19:08:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-02-06 19:08:56,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 31 letters. Loop has 1 letters. [2025-02-06 19:08:56,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:56,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 32 letters. Loop has 1 letters. [2025-02-06 19:08:56,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:56,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 31 letters. Loop has 2 letters. [2025-02-06 19:08:56,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:08:56,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 985 transitions. [2025-02-06 19:08:56,714 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-06 19:08:56,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 637 states and 835 transitions. [2025-02-06 19:08:56,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 315 [2025-02-06 19:08:56,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2025-02-06 19:08:56,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 637 states and 835 transitions. [2025-02-06 19:08:56,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:56,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 637 states and 835 transitions. [2025-02-06 19:08:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states and 835 transitions. [2025-02-06 19:08:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 561. [2025-02-06 19:08:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 501 states have (on average 1.2734530938123751) internal successors, (638), 500 states have internal predecessors, (638), 40 states have call successors, (44), 27 states have call predecessors, (44), 20 states have return successors, (50), 33 states have call predecessors, (50), 37 states have call successors, (50) [2025-02-06 19:08:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 732 transitions. [2025-02-06 19:08:56,730 INFO L240 hiAutomatonCegarLoop]: Abstraction has 561 states and 732 transitions. [2025-02-06 19:08:56,730 INFO L432 stractBuchiCegarLoop]: Abstraction has 561 states and 732 transitions. [2025-02-06 19:08:56,730 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-02-06 19:08:56,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 732 transitions. [2025-02-06 19:08:56,732 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 120 [2025-02-06 19:08:56,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:56,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:56,733 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, 1, 1] [2025-02-06 19:08:56,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:56,733 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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-06 19:08:56,734 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-06 19:08:56,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1752335201, now seen corresponding path program 1 times [2025-02-06 19:08:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948701921] [2025-02-06 19:08:56,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:56,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 19:08:56,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 19:08:56,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:56,812 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-06 19:08:56,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:08:56,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948701921] [2025-02-06 19:08:56,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948701921] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:08:56,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193787869] [2025-02-06 19:08:56,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:56,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:08:56,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:08:56,815 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:08:56,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-02-06 19:08:56,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 19:08:56,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 19:08:56,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:56,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:08:56,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 19:08:56,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:08:56,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-02-06 19:08:57,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-06 19:08:57,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:08:57,243 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-06 19:08:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193787869] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:08:57,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:08:57,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 27 [2025-02-06 19:08:57,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449705537] [2025-02-06 19:08:57,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:08:57,243 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:08:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -168570800, now seen corresponding path program 1 times [2025-02-06 19:08:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629500656] [2025-02-06 19:08:57,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:57,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:57,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:57,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:57,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:57,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:57,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:57,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:57,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:57,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:57,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:08:57,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 19:08:57,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-02-06 19:08:57,390 INFO L87 Difference]: Start difference. First operand 561 states and 732 transitions. cyclomatic complexity: 205 Second operand has 27 states, 25 states have (on average 3.08) internal successors, (77), 23 states have internal predecessors, (77), 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-06 19:08:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:08:57,949 INFO L93 Difference]: Finished difference Result 1082 states and 1431 transitions. [2025-02-06 19:08:57,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1082 states and 1431 transitions. [2025-02-06 19:08:57,954 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 322 [2025-02-06 19:08:57,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1082 states to 1076 states and 1425 transitions. [2025-02-06 19:08:57,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 643 [2025-02-06 19:08:57,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 643 [2025-02-06 19:08:57,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1076 states and 1425 transitions. [2025-02-06 19:08:57,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:08:57,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1076 states and 1425 transitions. [2025-02-06 19:08:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states and 1425 transitions. [2025-02-06 19:08:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 733. [2025-02-06 19:08:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 656 states have (on average 1.2560975609756098) internal successors, (824), 659 states have internal predecessors, (824), 49 states have call successors, (54), 29 states have call predecessors, (54), 28 states have return successors, (72), 44 states have call predecessors, (72), 46 states have call successors, (72) [2025-02-06 19:08:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 950 transitions. [2025-02-06 19:08:57,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 733 states and 950 transitions. [2025-02-06 19:08:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 19:08:57,980 INFO L432 stractBuchiCegarLoop]: Abstraction has 733 states and 950 transitions. [2025-02-06 19:08:57,980 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-02-06 19:08:57,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 733 states and 950 transitions. [2025-02-06 19:08:57,983 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 156 [2025-02-06 19:08:57,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:08:57,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:08:57,984 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, 1, 1] [2025-02-06 19:08:57,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:08:57,985 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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-06 19:08:57,985 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-06 19:08:57,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2070150753, now seen corresponding path program 1 times [2025-02-06 19:08:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:57,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027855358] [2025-02-06 19:08:57,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:08:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:57,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 19:08:58,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:08:58,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:58,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 19:08:58,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:08:58,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:58,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash -168570800, now seen corresponding path program 2 times [2025-02-06 19:08:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402134745] [2025-02-06 19:08:58,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:58,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:58,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:58,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:08:58,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:58,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:08:58,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:08:58,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:08:58,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:08:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1207853298, now seen corresponding path program 2 times [2025-02-06 19:08:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:08:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942657790] [2025-02-06 19:08:58,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:08:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:08:58,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-06 19:08:58,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 19:08:58,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:08:58,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,078 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:08:58,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 19:08:58,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 19:08:58,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:08:58,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:08:58,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:08,900 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:09:08,901 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:09:08,901 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:09:08,901 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:09:08,901 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:09:08,901 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:08,901 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:09:08,901 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:09:08,901 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration15_Lasso [2025-02-06 19:09:08,901 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:09:08,901 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:09:08,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:08,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:09,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:10,313 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:09:10,314 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:09:10,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,316 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:10,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-02-06 19:09:10,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:10,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:10,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:10,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-02-06 19:09:10,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,339 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:10,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-02-06 19:09:10,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:10,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:10,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:10,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-02-06 19:09:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,360 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-06 19:09:10,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-06 19:09:10,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:10,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-02-06 19:09:10,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,382 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-06 19:09:10,383 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-06 19:09:10,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:10,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:10,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:10,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:10,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,404 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-06 19:09:10,405 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-06 19:09:10,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,419 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,425 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-06 19:09:10,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,427 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-06 19:09:10,427 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-06 19:09:10,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-06 19:09:10,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,449 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-06 19:09:10,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,451 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-06 19:09:10,451 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-06 19:09:10,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,478 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-06 19:09:10,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,480 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-06 19:09:10,480 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-06 19:09:10,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,501 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-06 19:09:10,502 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-06 19:09:10,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:10,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:10,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:10,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-02-06 19:09:10,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,521 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-06 19:09:10,522 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-06 19:09:10,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:10,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-02-06 19:09:10,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,561 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-06 19:09:10,562 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-06 19:09:10,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-02-06 19:09:10,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,584 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-06 19:09:10,585 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-06 19:09:10,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,597 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2025-02-06 19:09:10,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,602 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-02-06 19:09:10,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-02-06 19:09:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,619 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-06 19:09:10,619 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-06 19:09:10,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-06 19:09:10,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-02-06 19:09:10,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,641 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-06 19:09:10,641 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-06 19:09:10,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-02-06 19:09:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,663 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-06 19:09:10,663 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-06 19:09:10,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:10,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:10,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:10,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:10,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:10,682 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-06 19:09:10,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,683 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-06 19:09:10,684 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-06 19:09:10,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:10,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:10,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:10,695 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-02-06 19:09:10,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:10,706 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-02-06 19:09:10,706 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-02-06 19:09:10,741 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:09:10,838 INFO L443 ModelExtractionUtils]: Simplification made 38 calls to the SMT solver. [2025-02-06 19:09:10,838 INFO L444 ModelExtractionUtils]: 7 out of 51 variables were initially zero. Simplification set additionally 41 variables to zero. [2025-02-06 19:09:10,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:10,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:10,841 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-06 19:09:10,842 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-06 19:09:10,843 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:09:10,854 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-02-06 19:09:10,854 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:09:10,854 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~j~0#1, v_rep(select #length merge_sort_#in~a#1.base)_5) = -4*merge_sort_merge_~j~0#1 + 1*v_rep(select #length merge_sort_#in~a#1.base)_5 Supporting invariants [] [2025-02-06 19:09:10,862 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-06 19:09:10,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:10,922 INFO L156 tatePredicateManager]: 17 out of 19 supporting invariants were superfluous and have been removed [2025-02-06 19:09:10,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:09:10,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:09:10,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:10,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 19:09:11,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:09:11,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:11,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:11,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 19:09:11,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:11,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:11,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:11,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:11,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:11,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:09:11,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:11,433 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-06 19:09:11,434 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2025-02-06 19:09:11,434 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 733 states and 950 transitions. cyclomatic complexity: 259 Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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-06 19:09:11,633 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 733 states and 950 transitions. cyclomatic complexity: 259. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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 823 states and 1075 transitions. Complement of second has 17 states. [2025-02-06 19:09:11,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:09:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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-06 19:09:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2025-02-06 19:09:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 55 letters. Loop has 7 letters. [2025-02-06 19:09:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:11,637 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:09:11,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:11,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 19:09:11,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:09:11,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:11,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:11,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 19:09:11,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:12,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:12,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:12,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:12,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:12,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:09:12,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:12,158 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-06 19:09:12,158 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 3 loop predicates [2025-02-06 19:09:12,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 733 states and 950 transitions. cyclomatic complexity: 259 Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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-06 19:09:12,385 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 733 states and 950 transitions. cyclomatic complexity: 259. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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 836 states and 1093 transitions. Complement of second has 19 states. [2025-02-06 19:09:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 6 stem states 3 non-accepting loop states 2 accepting loop states [2025-02-06 19:09:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 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-06 19:09:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2025-02-06 19:09:12,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 55 letters. Loop has 7 letters. [2025-02-06 19:09:12,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:12,387 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:09:12,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:12,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 19:09:12,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:09:12,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:12,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:12,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 19:09:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:12,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:12,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:12,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:12,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:12,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 19:09:12,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:12,840 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-06 19:09:12,841 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2025-02-06 19:09:12,842 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 733 states and 950 transitions. cyclomatic complexity: 259 Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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-06 19:09:13,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 733 states and 950 transitions. cyclomatic complexity: 259. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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 992 states and 1295 transitions. Complement of second has 38 states. [2025-02-06 19:09:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2025-02-06 19:09:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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-06 19:09:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2025-02-06 19:09:13,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 86 transitions. Stem has 55 letters. Loop has 7 letters. [2025-02-06 19:09:13,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:13,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 86 transitions. Stem has 62 letters. Loop has 7 letters. [2025-02-06 19:09:13,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:13,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 86 transitions. Stem has 55 letters. Loop has 14 letters. [2025-02-06 19:09:13,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:13,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 992 states and 1295 transitions. [2025-02-06 19:09:13,125 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 188 [2025-02-06 19:09:13,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 992 states to 977 states and 1269 transitions. [2025-02-06 19:09:13,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2025-02-06 19:09:13,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 512 [2025-02-06 19:09:13,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 977 states and 1269 transitions. [2025-02-06 19:09:13,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:13,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 977 states and 1269 transitions. [2025-02-06 19:09:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states and 1269 transitions. [2025-02-06 19:09:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 920. [2025-02-06 19:09:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 832 states have (on average 1.2608173076923077) internal successors, (1049), 834 states have internal predecessors, (1049), 57 states have call successors, (63), 31 states have call predecessors, (63), 31 states have return successors, (86), 54 states have call predecessors, (86), 54 states have call successors, (86) [2025-02-06 19:09:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1198 transitions. [2025-02-06 19:09:13,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 920 states and 1198 transitions. [2025-02-06 19:09:13,147 INFO L432 stractBuchiCegarLoop]: Abstraction has 920 states and 1198 transitions. [2025-02-06 19:09:13,147 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-02-06 19:09:13,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 920 states and 1198 transitions. [2025-02-06 19:09:13,150 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 178 [2025-02-06 19:09:13,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:13,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:13,151 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, 1, 1] [2025-02-06 19:09:13,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:13,151 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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-06 19:09:13,152 INFO L754 eck$LassoCheckResult]: Loop: "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;" [2025-02-06 19:09:13,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:13,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2070150753, now seen corresponding path program 3 times [2025-02-06 19:09:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:13,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434363244] [2025-02-06 19:09:13,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:13,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 5 equivalence classes. [2025-02-06 19:09:13,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:09:13,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 19:09:13,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:13,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:13,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 19:09:13,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:09:13,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:13,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:13,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:13,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash 34733, now seen corresponding path program 2 times [2025-02-06 19:09:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:13,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038385914] [2025-02-06 19:09:13,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:13,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:13,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:13,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:13,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:13,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:13,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:13,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:13,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:13,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:13,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:13,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:13,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash -425674417, now seen corresponding path program 4 times [2025-02-06 19:09:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:13,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76743190] [2025-02-06 19:09:13,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:13,259 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-06 19:09:13,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 19:09:13,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:13,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 43 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 19:09:13,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:13,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76743190] [2025-02-06 19:09:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76743190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:13,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121399179] [2025-02-06 19:09:13,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:13,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:13,590 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:13,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2025-02-06 19:09:13,668 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-06 19:09:13,773 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 19:09:13,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:13,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:13,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 19:09:13,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 23 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 19:09:13,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 19:09:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121399179] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:13,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 8] total 23 [2025-02-06 19:09:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303704103] [2025-02-06 19:09:13,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:14,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 19:09:14,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-02-06 19:09:14,032 INFO L87 Difference]: Start difference. First operand 920 states and 1198 transitions. cyclomatic complexity: 334 Second operand has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 19:09:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:14,565 INFO L93 Difference]: Finished difference Result 2446 states and 3222 transitions. [2025-02-06 19:09:14,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2446 states and 3222 transitions. [2025-02-06 19:09:14,575 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 601 [2025-02-06 19:09:14,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2446 states to 2430 states and 3198 transitions. [2025-02-06 19:09:14,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1328 [2025-02-06 19:09:14,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1364 [2025-02-06 19:09:14,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2430 states and 3198 transitions. [2025-02-06 19:09:14,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:14,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2430 states and 3198 transitions. [2025-02-06 19:09:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states and 3198 transitions. [2025-02-06 19:09:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1233. [2025-02-06 19:09:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1136 states have (on average 1.2544014084507042) internal successors, (1425), 1130 states have internal predecessors, (1425), 65 states have call successors, (71), 31 states have call predecessors, (71), 32 states have return successors, (104), 71 states have call predecessors, (104), 62 states have call successors, (104) [2025-02-06 19:09:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1600 transitions. [2025-02-06 19:09:14,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1233 states and 1600 transitions. [2025-02-06 19:09:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-06 19:09:14,626 INFO L432 stractBuchiCegarLoop]: Abstraction has 1233 states and 1600 transitions. [2025-02-06 19:09:14,626 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-02-06 19:09:14,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1233 states and 1600 transitions. [2025-02-06 19:09:14,630 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 265 [2025-02-06 19:09:14,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:14,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:14,631 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, 1, 1, 1, 1] [2025-02-06 19:09:14,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:14,631 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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-06 19:09:14,632 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-06 19:09:14,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2069227232, now seen corresponding path program 1 times [2025-02-06 19:09:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:14,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221363260] [2025-02-06 19:09:14,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:14,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 19:09:14,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:09:14,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:14,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:14,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:14,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 19:09:14,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 19:09:14,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:14,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:14,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:14,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash -167647279, now seen corresponding path program 2 times [2025-02-06 19:09:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070395842] [2025-02-06 19:09:14,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:14,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:14,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:14,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:14,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:14,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:14,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:14,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:14,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:14,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:14,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:14,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:14,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1337859538, now seen corresponding path program 2 times [2025-02-06 19:09:14,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:14,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76684714] [2025-02-06 19:09:14,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:14,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-06 19:09:14,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 19:09:14,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:14,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 33 proven. 27 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 19:09:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:15,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76684714] [2025-02-06 19:09:15,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76684714] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:15,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520865551] [2025-02-06 19:09:15,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:15,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:15,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:15,351 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:15,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2025-02-06 19:09:15,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-06 19:09:15,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 19:09:15,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:15,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:15,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 19:09:15,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 19:09:15,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 19:09:15,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520865551] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:15,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:15,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2025-02-06 19:09:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639066271] [2025-02-06 19:09:15,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:16,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:16,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 19:09:16,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2025-02-06 19:09:16,188 INFO L87 Difference]: Start difference. First operand 1233 states and 1600 transitions. cyclomatic complexity: 431 Second operand has 32 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 7 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 19:09:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:16,940 INFO L93 Difference]: Finished difference Result 1410 states and 1799 transitions. [2025-02-06 19:09:16,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1410 states and 1799 transitions. [2025-02-06 19:09:16,948 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 274 [2025-02-06 19:09:16,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1410 states to 1397 states and 1783 transitions. [2025-02-06 19:09:16,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 792 [2025-02-06 19:09:16,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 795 [2025-02-06 19:09:16,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1397 states and 1783 transitions. [2025-02-06 19:09:16,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:16,958 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1397 states and 1783 transitions. [2025-02-06 19:09:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states and 1783 transitions. [2025-02-06 19:09:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1353. [2025-02-06 19:09:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1254 states have (on average 1.2448165869218502) internal successors, (1561), 1246 states have internal predecessors, (1561), 66 states have call successors, (73), 34 states have call predecessors, (73), 33 states have return successors, (102), 72 states have call predecessors, (102), 63 states have call successors, (102) [2025-02-06 19:09:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1736 transitions. [2025-02-06 19:09:16,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1353 states and 1736 transitions. [2025-02-06 19:09:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 19:09:16,978 INFO L432 stractBuchiCegarLoop]: Abstraction has 1353 states and 1736 transitions. [2025-02-06 19:09:16,978 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-02-06 19:09:16,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1353 states and 1736 transitions. [2025-02-06 19:09:16,981 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 273 [2025-02-06 19:09:16,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:16,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:16,982 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, 1, 1] [2025-02-06 19:09:16,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:16,982 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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-06 19:09:16,982 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-06 19:09:16,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:16,983 INFO L85 PathProgramCache]: Analyzing trace with hash -425674427, now seen corresponding path program 5 times [2025-02-06 19:09:16,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:16,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451106867] [2025-02-06 19:09:16,983 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:16,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 5 equivalence classes. [2025-02-06 19:09:17,020 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 19:09:17,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 19:09:17,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 19:09:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451106867] [2025-02-06 19:09:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451106867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941599702] [2025-02-06 19:09:17,273 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:17,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:17,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:17,277 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:17,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2025-02-06 19:09:17,372 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 5 equivalence classes. [2025-02-06 19:09:17,498 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 19:09:17,498 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 19:09:17,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:17,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:09:17,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:17,623 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-06 19:09:17,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:17,737 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-06 19:09:17,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941599702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:17,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-02-06 19:09:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019726383] [2025-02-06 19:09:17,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:17,738 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:17,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 5 times [2025-02-06 19:09:17,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:17,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490438704] [2025-02-06 19:09:17,739 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:17,742 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:17,742 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:17,743 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:17,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:17,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:17,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:17,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:17,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:17,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:17,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 19:09:17,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-06 19:09:17,791 INFO L87 Difference]: Start difference. First operand 1353 states and 1736 transitions. cyclomatic complexity: 474 Second operand has 19 states, 16 states have (on average 4.5) internal successors, (72), 17 states have internal predecessors, (72), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 19:09:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:18,116 INFO L93 Difference]: Finished difference Result 2434 states and 3049 transitions. [2025-02-06 19:09:18,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3049 transitions. [2025-02-06 19:09:18,126 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 372 [2025-02-06 19:09:18,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2357 states and 2956 transitions. [2025-02-06 19:09:18,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1414 [2025-02-06 19:09:18,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1414 [2025-02-06 19:09:18,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2357 states and 2956 transitions. [2025-02-06 19:09:18,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:18,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2357 states and 2956 transitions. [2025-02-06 19:09:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states and 2956 transitions. [2025-02-06 19:09:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1676. [2025-02-06 19:09:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1580 states have (on average 1.2208860759493672) internal successors, (1929), 1562 states have internal predecessors, (1929), 64 states have call successors, (71), 37 states have call predecessors, (71), 32 states have return successors, (90), 76 states have call predecessors, (90), 61 states have call successors, (90) [2025-02-06 19:09:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2090 transitions. [2025-02-06 19:09:18,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1676 states and 2090 transitions. [2025-02-06 19:09:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 19:09:18,172 INFO L432 stractBuchiCegarLoop]: Abstraction has 1676 states and 2090 transitions. [2025-02-06 19:09:18,172 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-02-06 19:09:18,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1676 states and 2090 transitions. [2025-02-06 19:09:18,176 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 276 [2025-02-06 19:09:18,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:18,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:18,177 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, 1, 1] [2025-02-06 19:09:18,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:18,177 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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-06 19:09:18,177 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-06 19:09:18,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:18,178 INFO L85 PathProgramCache]: Analyzing trace with hash -849076176, now seen corresponding path program 1 times [2025-02-06 19:09:18,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:18,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143982210] [2025-02-06 19:09:18,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:18,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 19:09:18,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 19:09:18,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:18,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:18,316 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-06 19:09:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143982210] [2025-02-06 19:09:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143982210] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452031892] [2025-02-06 19:09:18,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:09:18,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:18,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:18,320 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:18,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2025-02-06 19:09:18,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 19:09:18,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 19:09:18,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:18,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:18,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 19:09:18,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:18,591 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-06 19:09:18,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:18,707 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-06 19:09:18,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452031892] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:18,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:18,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 19 [2025-02-06 19:09:18,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369075598] [2025-02-06 19:09:18,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:18,708 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 6 times [2025-02-06 19:09:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079442940] [2025-02-06 19:09:18,709 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:09:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:18,713 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:18,714 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:18,714 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:09:18,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:18,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:18,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:18,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:18,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:18,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:18,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:18,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 19:09:18,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-06 19:09:18,787 INFO L87 Difference]: Start difference. First operand 1676 states and 2090 transitions. cyclomatic complexity: 501 Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 16 states have internal predecessors, (78), 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-06 19:09:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:19,134 INFO L93 Difference]: Finished difference Result 2370 states and 2942 transitions. [2025-02-06 19:09:19,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2370 states and 2942 transitions. [2025-02-06 19:09:19,149 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 445 [2025-02-06 19:09:19,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2370 states to 2358 states and 2927 transitions. [2025-02-06 19:09:19,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1420 [2025-02-06 19:09:19,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1420 [2025-02-06 19:09:19,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2358 states and 2927 transitions. [2025-02-06 19:09:19,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:19,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2358 states and 2927 transitions. [2025-02-06 19:09:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states and 2927 transitions. [2025-02-06 19:09:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2010. [2025-02-06 19:09:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1914 states have (on average 1.2251828631138977) internal successors, (2345), 1896 states have internal predecessors, (2345), 64 states have call successors, (71), 37 states have call predecessors, (71), 32 states have return successors, (90), 76 states have call predecessors, (90), 61 states have call successors, (90) [2025-02-06 19:09:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2506 transitions. [2025-02-06 19:09:19,204 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2010 states and 2506 transitions. [2025-02-06 19:09:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 19:09:19,205 INFO L432 stractBuchiCegarLoop]: Abstraction has 2010 states and 2506 transitions. [2025-02-06 19:09:19,205 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-02-06 19:09:19,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2010 states and 2506 transitions. [2025-02-06 19:09:19,211 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 339 [2025-02-06 19:09:19,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:19,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:19,212 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, 1, 1] [2025-02-06 19:09:19,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:19,212 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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-06 19:09:19,212 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-06 19:09:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash -78400238, now seen corresponding path program 6 times [2025-02-06 19:09:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043183825] [2025-02-06 19:09:19,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:09:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:19,226 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 5 equivalence classes. [2025-02-06 19:09:19,274 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:09:19,274 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 19:09:19,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:19,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:19,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 19:09:19,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:09:19,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:19,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:19,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 7 times [2025-02-06 19:09:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:19,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868182791] [2025-02-06 19:09:19,309 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:09:19,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:19,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:19,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:19,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:19,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:19,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:19,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:19,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:19,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:19,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:19,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:19,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1864559920, now seen corresponding path program 7 times [2025-02-06 19:09:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:19,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374455559] [2025-02-06 19:09:19,317 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:09:19,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:19,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 19:09:19,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:09:19,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:19,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:19,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:19,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 19:09:19,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:09:19,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:19,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:19,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:32,860 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:09:32,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:09:32,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:09:32,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:09:32,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:09:32,860 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:32,860 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:09:32,860 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:09:32,860 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration20_Lasso [2025-02-06 19:09:32,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:09:32,860 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:09:32,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:32,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:09:34,837 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:09:34,837 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:09:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,841 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-06 19:09:34,841 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-06 19:09:34,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:34,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,860 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-06 19:09:34,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,863 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-06 19:09:34,863 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-06 19:09:34,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:34,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-02-06 19:09:34,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,888 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-06 19:09:34,889 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-06 19:09:34,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:34,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,909 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-06 19:09:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,912 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-06 19:09:34,912 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-06 19:09:34,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:34,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,930 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-06 19:09:34,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,932 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-06 19:09:34,933 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-06 19:09:34,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:34,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,953 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-06 19:09:34,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,955 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-06 19:09:34,956 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-06 19:09:34,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:34,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-02-06 19:09:34,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:34,979 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-06 19:09:34,980 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-06 19:09:34,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:34,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:34,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:34,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:34,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:34,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:34,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:34,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:34,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:34,997 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-06 19:09:34,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:34,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,000 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-06 19:09:35,001 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-06 19:09:35,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-02-06 19:09:35,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,027 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-06 19:09:35,028 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-06 19:09:35,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,049 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-06 19:09:35,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,051 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-06 19:09:35,053 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-06 19:09:35,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,072 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-06 19:09:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,074 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-06 19:09:35,075 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-06 19:09:35,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-02-06 19:09:35,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,094 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-06 19:09:35,094 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-06 19:09:35,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:35,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,114 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-06 19:09:35,115 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-06 19:09:35,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,129 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,135 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-06 19:09:35,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,137 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-06 19:09:35,138 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-06 19:09:35,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,156 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-06 19:09:35,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,158 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-06 19:09:35,159 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-06 19:09:35,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:35,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,173 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-02-06 19:09:35,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,181 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:09:35,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-02-06 19:09:35,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:35,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,193 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-02-06 19:09:35,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,200 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-06 19:09:35,201 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-06 19:09:35,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-02-06 19:09:35,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,221 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-06 19:09:35,222 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-06 19:09: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-06 19:09:35,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,245 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-06 19:09:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,247 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-06 19:09:35,248 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-06 19:09:35,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:35,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,270 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-06 19:09:35,271 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-06 19:09:35,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:35,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2025-02-06 19:09:35,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,302 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-06 19:09:35,303 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-06 19:09:35,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-02-06 19:09:35,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,332 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-06 19:09:35,333 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-06 19:09:35,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-02-06 19:09:35,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,352 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-06 19:09:35,353 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-06 19:09:35,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2025-02-06 19:09:35,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,373 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-06 19:09:35,374 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-06 19:09:35,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:35,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-02-06 19:09:35,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,396 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-06 19:09:35,397 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-06 19:09:35,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:35,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-02-06 19:09:35,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,416 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-06 19:09:35,416 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-06 19:09:35,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,433 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-06 19:09:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,435 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-06 19:09:35,437 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-06 19:09:35,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:09:35,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,456 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-06 19:09:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,459 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-06 19:09:35,460 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-06 19:09:35,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,481 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-06 19:09:35,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,483 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-06 19:09:35,484 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-06 19:09:35,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict 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-06 19:09:35,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:09:35,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:09:35,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:09:35,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:09:35,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2025-02-06 19:09:35,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,505 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-06 19:09:35,505 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-06 19:09:35,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-06 19:09:35,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:09:35,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:09:35,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:09:35,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:09:35,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:09:35,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:09:35,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:09:35,560 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-02-06 19:09:35,560 INFO L444 ModelExtractionUtils]: 14 out of 31 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-02-06 19:09:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:09:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:35,562 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-06 19:09:35,563 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-06 19:09:35,563 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:09:35,574 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:09:35,574 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:09:35,574 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1) = -2*merge_sort_merge_~i~0#1 + 5 Supporting invariants [] [2025-02-06 19:09:35,580 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-06 19:09:35,655 INFO L156 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2025-02-06 19:09:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:35,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 19:09:35,741 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-06 19:09:35,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:09:35,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:35,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:35,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 19:09:35,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:36,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:36,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:36,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:36,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:36,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:36,085 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-06 19:09:36,086 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 1 loop predicates [2025-02-06 19:09:36,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2010 states and 2506 transitions. cyclomatic complexity: 599 Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-06 19:09:36,236 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2010 states and 2506 transitions. cyclomatic complexity: 599. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 2092 states and 2618 transitions. Complement of second has 14 states. [2025-02-06 19:09:36,237 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-06 19:09:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-06 19:09:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2025-02-06 19:09:36,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 65 letters. Loop has 1 letters. [2025-02-06 19:09:36,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:36,237 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:09:36,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:36,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 19:09:36,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:09:36,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:36,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 19:09:36,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:36,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:36,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:36,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:36,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:36,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:36,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:36,711 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-06 19:09:36,711 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.15 stem predicates 1 loop predicates [2025-02-06 19:09:36,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2010 states and 2506 transitions. cyclomatic complexity: 599 Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:09:37,021 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2010 states and 2506 transitions. cyclomatic complexity: 599. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Result 2149 states and 2691 transitions. Complement of second has 21 states. [2025-02-06 19:09:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 12 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:09:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 19:09:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2025-02-06 19:09:37,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 34 transitions. Stem has 65 letters. Loop has 1 letters. [2025-02-06 19:09:37,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:37,023 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 19:09:37,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:37,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 19:09:37,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 19:09:37,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:37,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:37,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 19:09:37,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:37,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:37,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:37,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:37,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:37,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:37,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:37,439 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-06 19:09:37,439 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 1 loop predicates [2025-02-06 19:09:37,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2010 states and 2506 transitions. cyclomatic complexity: 599 Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-06 19:09:37,625 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2010 states and 2506 transitions. cyclomatic complexity: 599. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 2081 states and 2599 transitions. Complement of second has 16 states. [2025-02-06 19:09:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 10 stem states 0 non-accepting loop states 2 accepting loop states [2025-02-06 19:09:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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-06 19:09:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2025-02-06 19:09:37,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 65 letters. Loop has 1 letters. [2025-02-06 19:09:37,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:37,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 66 letters. Loop has 1 letters. [2025-02-06 19:09:37,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:37,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 57 transitions. Stem has 65 letters. Loop has 2 letters. [2025-02-06 19:09:37,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:09:37,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2081 states and 2599 transitions. [2025-02-06 19:09:37,633 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 340 [2025-02-06 19:09:37,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2081 states to 1979 states and 2477 transitions. [2025-02-06 19:09:37,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1155 [2025-02-06 19:09:37,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1166 [2025-02-06 19:09:37,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1979 states and 2477 transitions. [2025-02-06 19:09:37,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:37,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1979 states and 2477 transitions. [2025-02-06 19:09:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states and 2477 transitions. [2025-02-06 19:09:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1959. [2025-02-06 19:09:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1870 states have (on average 1.2256684491978609) internal successors, (2292), 1851 states have internal predecessors, (2292), 59 states have call successors, (66), 34 states have call predecessors, (66), 30 states have return successors, (86), 73 states have call predecessors, (86), 57 states have call successors, (86) [2025-02-06 19:09:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2444 transitions. [2025-02-06 19:09:37,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1959 states and 2444 transitions. [2025-02-06 19:09:37,700 INFO L432 stractBuchiCegarLoop]: Abstraction has 1959 states and 2444 transitions. [2025-02-06 19:09:37,700 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-02-06 19:09:37,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1959 states and 2444 transitions. [2025-02-06 19:09:37,704 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 339 [2025-02-06 19:09:37,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:37,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:37,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:37,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:37,706 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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-06 19:09:37,706 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-06 19:09:37,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash -112743507, now seen corresponding path program 8 times [2025-02-06 19:09:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:37,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174671233] [2025-02-06 19:09:37,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:37,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:37,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-06 19:09:37,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:09:37,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:37,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 36 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 19:09:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:37,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174671233] [2025-02-06 19:09:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174671233] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997392963] [2025-02-06 19:09:37,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:37,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:37,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:37,956 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:37,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2025-02-06 19:09:38,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-06 19:09:38,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:09:38,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:38,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:38,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 19:09:38,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 39 proven. 20 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-06 19:09:38,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 39 proven. 23 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 19:09:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997392963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:38,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 21 [2025-02-06 19:09:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774565234] [2025-02-06 19:09:38,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:38,493 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:38,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:38,494 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 8 times [2025-02-06 19:09:38,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:38,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985831744] [2025-02-06 19:09:38,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:38,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:38,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:38,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:38,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:38,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:38,497 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:38,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:38,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:38,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:38,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:38,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:38,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 19:09:38,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-02-06 19:09:38,539 INFO L87 Difference]: Start difference. First operand 1959 states and 2444 transitions. cyclomatic complexity: 585 Second operand has 21 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 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-06 19:09:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:38,716 INFO L93 Difference]: Finished difference Result 1839 states and 2335 transitions. [2025-02-06 19:09:38,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1839 states and 2335 transitions. [2025-02-06 19:09:38,723 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 396 [2025-02-06 19:09:38,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1839 states to 1839 states and 2335 transitions. [2025-02-06 19:09:38,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1116 [2025-02-06 19:09:38,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1116 [2025-02-06 19:09:38,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1839 states and 2335 transitions. [2025-02-06 19:09:38,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:38,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1839 states and 2335 transitions. [2025-02-06 19:09:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states and 2335 transitions. [2025-02-06 19:09:38,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1578. [2025-02-06 19:09:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1510 states have (on average 1.2344370860927152) internal successors, (1864), 1497 states have internal predecessors, (1864), 46 states have call successors, (50), 24 states have call predecessors, (50), 22 states have return successors, (68), 56 states have call predecessors, (68), 44 states have call successors, (68) [2025-02-06 19:09:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1982 transitions. [2025-02-06 19:09:38,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1578 states and 1982 transitions. [2025-02-06 19:09:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 19:09:38,757 INFO L432 stractBuchiCegarLoop]: Abstraction has 1578 states and 1982 transitions. [2025-02-06 19:09:38,757 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-02-06 19:09:38,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1578 states and 1982 transitions. [2025-02-06 19:09:38,760 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 300 [2025-02-06 19:09:38,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:38,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:38,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:38,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 19:09:38,761 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;" >"#39#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-06 19:09:38,761 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-06 19:09:38,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:38,761 INFO L85 PathProgramCache]: Analyzing trace with hash -831721784, now seen corresponding path program 4 times [2025-02-06 19:09:38,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:38,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403092422] [2025-02-06 19:09:38,761 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:38,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:38,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-06 19:09:38,770 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-02-06 19:09:38,770 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:09:38,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:38,934 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-06 19:09:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403092422] [2025-02-06 19:09:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403092422] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341150826] [2025-02-06 19:09:38,934 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:38,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:38,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:38,936 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:38,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2025-02-06 19:09:39,026 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-02-06 19:09:39,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-02-06 19:09:39,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:09:39,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:39,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:09:39,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:39,097 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-06 19:09:39,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:39,209 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-06 19:09:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341150826] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:39,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-02-06 19:09:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656485824] [2025-02-06 19:09:39,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:39,210 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:39,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:39,210 INFO L85 PathProgramCache]: Analyzing trace with hash 50630, now seen corresponding path program 5 times [2025-02-06 19:09:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:39,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419757904] [2025-02-06 19:09:39,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:39,212 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:39,214 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:39,214 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:39,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:39,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:39,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:09:39,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:09:39,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:39,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:39,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:39,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 19:09:39,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-06 19:09:39,347 INFO L87 Difference]: Start difference. First operand 1578 states and 1982 transitions. cyclomatic complexity: 480 Second operand has 18 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 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-06 19:09:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:39,554 INFO L93 Difference]: Finished difference Result 1022 states and 1286 transitions. [2025-02-06 19:09:39,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1022 states and 1286 transitions. [2025-02-06 19:09:39,558 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 248 [2025-02-06 19:09:39,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1022 states to 1015 states and 1279 transitions. [2025-02-06 19:09:39,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 767 [2025-02-06 19:09:39,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 770 [2025-02-06 19:09:39,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1279 transitions. [2025-02-06 19:09:39,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:39,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1279 transitions. [2025-02-06 19:09:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1279 transitions. [2025-02-06 19:09:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 937. [2025-02-06 19:09:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 891 states have (on average 1.2368125701459034) internal successors, (1102), 889 states have internal predecessors, (1102), 29 states have call successors, (30), 17 states have call predecessors, (30), 17 states have return successors, (53), 30 states have call predecessors, (53), 27 states have call successors, (53) [2025-02-06 19:09:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1185 transitions. [2025-02-06 19:09:39,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 937 states and 1185 transitions. [2025-02-06 19:09:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:09:39,578 INFO L432 stractBuchiCegarLoop]: Abstraction has 937 states and 1185 transitions. [2025-02-06 19:09:39,578 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-02-06 19:09:39,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 937 states and 1185 transitions. [2025-02-06 19:09:39,581 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 221 [2025-02-06 19:09:39,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:39,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:39,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:39,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:39,582 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;" >"#39#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;" >"#37#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;" >"#39#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;" >"#39#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;" >"#37#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-06 19:09:39,583 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-06 19:09:39,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash 308424095, now seen corresponding path program 9 times [2025-02-06 19:09:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:39,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789319194] [2025-02-06 19:09:39,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:39,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 8 equivalence classes. [2025-02-06 19:09:39,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 56 of 63 statements. [2025-02-06 19:09:39,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 19:09:39,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 19:09:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:40,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789319194] [2025-02-06 19:09:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789319194] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:40,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142316140] [2025-02-06 19:09:40,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:40,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:40,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:40,520 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:40,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Waiting until timeout for monitored process [2025-02-06 19:09:40,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 8 equivalence classes. [2025-02-06 19:09:40,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 56 of 63 statements. [2025-02-06 19:09:40,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 19:09:40,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:40,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 19:09:40,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 19:09:41,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 19:09:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142316140] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:41,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 42 [2025-02-06 19:09:41,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25577564] [2025-02-06 19:09:41,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:41,413 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash -168570800, now seen corresponding path program 3 times [2025-02-06 19:09:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996853564] [2025-02-06 19:09:41,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:41,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:41,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:41,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:09:41,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:41,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:41,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:41,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:41,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:41,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:41,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:41,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 19:09:41,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 19:09:41,550 INFO L87 Difference]: Start difference. First operand 937 states and 1185 transitions. cyclomatic complexity: 298 Second operand has 42 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 33 states have internal predecessors, (89), 15 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2025-02-06 19:09:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:42,573 INFO L93 Difference]: Finished difference Result 2279 states and 2952 transitions. [2025-02-06 19:09:42,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2279 states and 2952 transitions. [2025-02-06 19:09:42,581 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 558 [2025-02-06 19:09:42,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2279 states to 2276 states and 2949 transitions. [2025-02-06 19:09:42,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1626 [2025-02-06 19:09:42,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1626 [2025-02-06 19:09:42,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2276 states and 2949 transitions. [2025-02-06 19:09:42,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:42,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2276 states and 2949 transitions. [2025-02-06 19:09:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states and 2949 transitions. [2025-02-06 19:09:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1239. [2025-02-06 19:09:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1169 states have (on average 1.234388366124893) internal successors, (1443), 1177 states have internal predecessors, (1443), 41 states have call successors, (42), 21 states have call predecessors, (42), 29 states have return successors, (106), 40 states have call predecessors, (106), 38 states have call successors, (106) [2025-02-06 19:09:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1591 transitions. [2025-02-06 19:09:42,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1239 states and 1591 transitions. [2025-02-06 19:09:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-06 19:09:42,613 INFO L432 stractBuchiCegarLoop]: Abstraction has 1239 states and 1591 transitions. [2025-02-06 19:09:42,613 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-02-06 19:09:42,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1239 states and 1591 transitions. [2025-02-06 19:09:42,615 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 302 [2025-02-06 19:09:42,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:42,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:42,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:42,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:42,616 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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);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-06 19:09:42,617 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-06 19:09:42,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash -754683814, now seen corresponding path program 3 times [2025-02-06 19:09:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:42,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910581598] [2025-02-06 19:09:42,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:42,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 6 equivalence classes. [2025-02-06 19:09:42,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 57 of 65 statements. [2025-02-06 19:09:42,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:09:42,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 19:09:42,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910581598] [2025-02-06 19:09:42,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910581598] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:42,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30667539] [2025-02-06 19:09:42,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:42,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:42,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:42,727 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:42,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2025-02-06 19:09:42,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 6 equivalence classes. [2025-02-06 19:09:42,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 57 of 65 statements. [2025-02-06 19:09:42,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 19:09:42,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:42,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:09:42,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 19:09:42,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 19:09:43,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30667539] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:43,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:43,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-06 19:09:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791170813] [2025-02-06 19:09:43,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:43,004 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:43,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -167647279, now seen corresponding path program 3 times [2025-02-06 19:09:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:43,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947612637] [2025-02-06 19:09:43,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:43,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:43,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:43,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:09:43,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:43,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:43,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:43,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:43,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:43,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:43,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:43,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 19:09:43,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 19:09:43,162 INFO L87 Difference]: Start difference. First operand 1239 states and 1591 transitions. cyclomatic complexity: 413 Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 19:09:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:43,204 INFO L93 Difference]: Finished difference Result 1424 states and 1823 transitions. [2025-02-06 19:09:43,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1424 states and 1823 transitions. [2025-02-06 19:09:43,208 INFO L131 ngComponentsAnalysis]: Automaton has 58 accepting balls. 373 [2025-02-06 19:09:43,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1424 states to 1424 states and 1823 transitions. [2025-02-06 19:09:43,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1013 [2025-02-06 19:09:43,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1013 [2025-02-06 19:09:43,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1424 states and 1823 transitions. [2025-02-06 19:09:43,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:43,216 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1424 states and 1823 transitions. [2025-02-06 19:09:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states and 1823 transitions. [2025-02-06 19:09:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 948. [2025-02-06 19:09:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 902 states have (on average 1.2339246119733924) internal successors, (1113), 900 states have internal predecessors, (1113), 29 states have call successors, (30), 17 states have call predecessors, (30), 17 states have return successors, (53), 30 states have call predecessors, (53), 27 states have call successors, (53) [2025-02-06 19:09:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1196 transitions. [2025-02-06 19:09:43,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 948 states and 1196 transitions. [2025-02-06 19:09:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:09:43,229 INFO L432 stractBuchiCegarLoop]: Abstraction has 948 states and 1196 transitions. [2025-02-06 19:09:43,229 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-02-06 19:09:43,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 948 states and 1196 transitions. [2025-02-06 19:09:43,231 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 221 [2025-02-06 19:09:43,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:43,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:43,231 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, 1, 1] [2025-02-06 19:09:43,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:43,231 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;" >"#39#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;" >"#37#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;" >"#39#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;" >"#39#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;" >"#37#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-06 19:09:43,235 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-06 19:09:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash -47633879, now seen corresponding path program 10 times [2025-02-06 19:09:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597596915] [2025-02-06 19:09:43,236 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:43,246 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-02-06 19:09:43,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 19:09:43,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:43,276 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:43,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 19:09:43,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 19:09:43,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:43,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:43,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:43,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash -168570800, now seen corresponding path program 4 times [2025-02-06 19:09:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942361943] [2025-02-06 19:09:43,308 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:43,311 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:09:43,312 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:43,312 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:43,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:43,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:43,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:43,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:43,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:43,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:43,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1254725336, now seen corresponding path program 11 times [2025-02-06 19:09:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870348144] [2025-02-06 19:09:43,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:43,328 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 71 statements into 8 equivalence classes. [2025-02-06 19:09:43,351 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 19:09:43,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-06 19:09:43,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 19:09:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870348144] [2025-02-06 19:09:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870348144] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50965062] [2025-02-06 19:09:43,752 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:43,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:43,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:43,755 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:43,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2025-02-06 19:09:43,865 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 71 statements into 8 equivalence classes. [2025-02-06 19:09:43,995 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 19:09:43,995 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-06 19:09:43,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:43,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:09:43,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:44,113 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-06 19:09:44,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 19:09:44,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50965062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:09:44,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 19:09:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 25 [2025-02-06 19:09:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039199532] [2025-02-06 19:09:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:09:44,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:44,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 19:09:44,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-02-06 19:09:44,239 INFO L87 Difference]: Start difference. First operand 948 states and 1196 transitions. cyclomatic complexity: 298 Second operand has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-06 19:09:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:44,295 INFO L93 Difference]: Finished difference Result 974 states and 1204 transitions. [2025-02-06 19:09:44,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 974 states and 1204 transitions. [2025-02-06 19:09:44,298 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 167 [2025-02-06 19:09:44,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 974 states to 965 states and 1195 transitions. [2025-02-06 19:09:44,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 724 [2025-02-06 19:09:44,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 789 [2025-02-06 19:09:44,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 965 states and 1195 transitions. [2025-02-06 19:09:44,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:44,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 965 states and 1195 transitions. [2025-02-06 19:09:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states and 1195 transitions. [2025-02-06 19:09:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 909. [2025-02-06 19:09:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 863 states have (on average 1.2236384704519119) internal successors, (1056), 861 states have internal predecessors, (1056), 29 states have call successors, (30), 17 states have call predecessors, (30), 17 states have return successors, (53), 30 states have call predecessors, (53), 27 states have call successors, (53) [2025-02-06 19:09:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1139 transitions. [2025-02-06 19:09:44,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 909 states and 1139 transitions. [2025-02-06 19:09:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 19:09:44,310 INFO L432 stractBuchiCegarLoop]: Abstraction has 909 states and 1139 transitions. [2025-02-06 19:09:44,310 INFO L338 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-02-06 19:09:44,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 909 states and 1139 transitions. [2025-02-06 19:09:44,311 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 167 [2025-02-06 19:09:44,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:44,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:44,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:44,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:44,312 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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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);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-06 19:09:44,312 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-06 19:09:44,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash 630576418, now seen corresponding path program 4 times [2025-02-06 19:09:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482775351] [2025-02-06 19:09:44,313 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:44,321 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-02-06 19:09:44,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:09:44,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:44,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 36 proven. 31 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 19:09:44,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:44,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482775351] [2025-02-06 19:09:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482775351] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:44,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302824061] [2025-02-06 19:09:44,609 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:44,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:44,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:44,612 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:44,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2025-02-06 19:09:44,721 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-02-06 19:09:44,843 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 19:09:44,843 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:44,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:44,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 19:09:44,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 35 proven. 32 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 19:09:44,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 35 proven. 32 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 19:09:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302824061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:45,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:45,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2025-02-06 19:09:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519331818] [2025-02-06 19:09:45,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:45,069 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash -167647279, now seen corresponding path program 4 times [2025-02-06 19:09:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767690523] [2025-02-06 19:09:45,070 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:45,073 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:09:45,074 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:45,075 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:45,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:45,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:45,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:45,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:45,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:45,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:45,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:45,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:45,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 19:09:45,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-02-06 19:09:45,239 INFO L87 Difference]: Start difference. First operand 909 states and 1139 transitions. cyclomatic complexity: 269 Second operand has 23 states, 17 states have (on average 2.823529411764706) internal successors, (48), 20 states have internal predecessors, (48), 7 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 19:09:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:45,461 INFO L93 Difference]: Finished difference Result 1195 states and 1486 transitions. [2025-02-06 19:09:45,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1195 states and 1486 transitions. [2025-02-06 19:09:45,465 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 189 [2025-02-06 19:09:45,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1195 states to 1155 states and 1441 transitions. [2025-02-06 19:09:45,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 858 [2025-02-06 19:09:45,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 858 [2025-02-06 19:09:45,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1155 states and 1441 transitions. [2025-02-06 19:09:45,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:45,470 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1155 states and 1441 transitions. [2025-02-06 19:09:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states and 1441 transitions. [2025-02-06 19:09:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 965. [2025-02-06 19:09:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 912 states have (on average 1.219298245614035) internal successors, (1112), 912 states have internal predecessors, (1112), 33 states have call successors, (34), 20 states have call predecessors, (34), 20 states have return successors, (56), 32 states have call predecessors, (56), 30 states have call successors, (56) [2025-02-06 19:09:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1202 transitions. [2025-02-06 19:09:45,478 INFO L240 hiAutomatonCegarLoop]: Abstraction has 965 states and 1202 transitions. [2025-02-06 19:09:45,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 19:09:45,479 INFO L432 stractBuchiCegarLoop]: Abstraction has 965 states and 1202 transitions. [2025-02-06 19:09:45,479 INFO L338 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-02-06 19:09:45,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 965 states and 1202 transitions. [2025-02-06 19:09:45,481 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 167 [2025-02-06 19:09:45,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:45,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:45,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:45,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:45,482 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;" >"#39#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;" >"#37#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;" >"#39#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;" >"#39#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;" >"#37#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;" [2025-02-06 19:09:45,482 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-06 19:09:45,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash -968877573, now seen corresponding path program 12 times [2025-02-06 19:09:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:45,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148202411] [2025-02-06 19:09:45,482 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:09:45,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:45,493 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 8 equivalence classes. [2025-02-06 19:09:45,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 19:09:45,530 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 19:09:45,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:45,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:45,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 19:09:45,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 19:09:45,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:45,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:45,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:45,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:45,560 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 9 times [2025-02-06 19:09:45,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:45,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684772929] [2025-02-06 19:09:45,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:09:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:45,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:45,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:45,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:09:45,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:45,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:45,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:45,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:45,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:45,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:45,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:45,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:45,567 INFO L85 PathProgramCache]: Analyzing trace with hash 29566311, now seen corresponding path program 13 times [2025-02-06 19:09:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:45,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554998988] [2025-02-06 19:09:45,567 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:09:45,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:45,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 19:09:45,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:09:45,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:45,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 75 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 19:09:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554998988] [2025-02-06 19:09:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554998988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:46,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397032242] [2025-02-06 19:09:46,107 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:09:46,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:46,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:46,109 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:46,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2025-02-06 19:09:46,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 19:09:46,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:09:46,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:46,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:46,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 19:09:46,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 19:09:46,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 19:09:46,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397032242] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:46,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:46,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 31 [2025-02-06 19:09:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250408533] [2025-02-06 19:09:46,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:46,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 19:09:46,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-02-06 19:09:46,679 INFO L87 Difference]: Start difference. First operand 965 states and 1202 transitions. cyclomatic complexity: 278 Second operand has 32 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 28 states have internal predecessors, (69), 9 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-06 19:09:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:47,227 INFO L93 Difference]: Finished difference Result 1247 states and 1530 transitions. [2025-02-06 19:09:47,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1247 states and 1530 transitions. [2025-02-06 19:09:47,230 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 186 [2025-02-06 19:09:47,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1247 states to 1200 states and 1476 transitions. [2025-02-06 19:09:47,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 950 [2025-02-06 19:09:47,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 956 [2025-02-06 19:09:47,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1200 states and 1476 transitions. [2025-02-06 19:09:47,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:47,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1200 states and 1476 transitions. [2025-02-06 19:09:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states and 1476 transitions. [2025-02-06 19:09:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1049. [2025-02-06 19:09:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 987 states have (on average 1.2127659574468086) internal successors, (1197), 987 states have internal predecessors, (1197), 40 states have call successors, (41), 24 states have call predecessors, (41), 22 states have return successors, (62), 37 states have call predecessors, (62), 36 states have call successors, (62) [2025-02-06 19:09:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1300 transitions. [2025-02-06 19:09:47,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1049 states and 1300 transitions. [2025-02-06 19:09:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 19:09:47,259 INFO L432 stractBuchiCegarLoop]: Abstraction has 1049 states and 1300 transitions. [2025-02-06 19:09:47,259 INFO L338 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-02-06 19:09:47,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1049 states and 1300 transitions. [2025-02-06 19:09:47,261 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 167 [2025-02-06 19:09:47,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:47,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:47,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:47,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:09:47,263 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;" >"#39#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;" >"#37#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;" >"#39#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;" >"#39#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;" >"#37#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;" [2025-02-06 19:09:47,263 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-06 19:09:47,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash 634473238, now seen corresponding path program 14 times [2025-02-06 19:09:47,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:47,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446617405] [2025-02-06 19:09:47,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:47,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:47,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-02-06 19:09:47,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:09:47,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 40 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-06 19:09:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446617405] [2025-02-06 19:09:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446617405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817526839] [2025-02-06 19:09:47,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:09:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:47,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:47,845 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:47,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2025-02-06 19:09:47,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-02-06 19:09:48,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 19:09:48,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:09:48,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:48,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 19:09:48,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 45 proven. 34 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 19:09:48,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 51 proven. 32 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-06 19:09:48,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817526839] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:48,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 29 [2025-02-06 19:09:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835660094] [2025-02-06 19:09:48,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:48,480 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:48,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 33, now seen corresponding path program 10 times [2025-02-06 19:09:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:48,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736837726] [2025-02-06 19:09:48,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:09:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:48,484 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-06 19:09:48,484 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:48,484 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:09:48,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:48,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:48,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:09:48,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:09:48,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:48,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:48,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:48,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 19:09:48,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-02-06 19:09:48,533 INFO L87 Difference]: Start difference. First operand 1049 states and 1300 transitions. cyclomatic complexity: 293 Second operand has 29 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 14 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-06 19:09:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:48,893 INFO L93 Difference]: Finished difference Result 1297 states and 1610 transitions. [2025-02-06 19:09:48,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1297 states and 1610 transitions. [2025-02-06 19:09:48,896 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 233 [2025-02-06 19:09:48,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1297 states to 1297 states and 1610 transitions. [2025-02-06 19:09:48,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1053 [2025-02-06 19:09:48,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1053 [2025-02-06 19:09:48,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1297 states and 1610 transitions. [2025-02-06 19:09:48,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:48,904 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1297 states and 1610 transitions. [2025-02-06 19:09:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states and 1610 transitions. [2025-02-06 19:09:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1199. [2025-02-06 19:09:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1130 states have (on average 1.2141592920353983) internal successors, (1372), 1131 states have internal predecessors, (1372), 45 states have call successors, (46), 26 states have call predecessors, (46), 24 states have return successors, (70), 41 states have call predecessors, (70), 41 states have call successors, (70) [2025-02-06 19:09:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1488 transitions. [2025-02-06 19:09:48,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1199 states and 1488 transitions. [2025-02-06 19:09:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 19:09:48,917 INFO L432 stractBuchiCegarLoop]: Abstraction has 1199 states and 1488 transitions. [2025-02-06 19:09:48,917 INFO L338 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-02-06 19:09:48,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1199 states and 1488 transitions. [2025-02-06 19:09:48,919 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 222 [2025-02-06 19:09:48,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:48,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:48,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 19:09:48,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:48,921 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;" >"#39#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;" >"#37#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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;" "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;" >"#37#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);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-06 19:09:48,921 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-06 19:09:48,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1473790495, now seen corresponding path program 5 times [2025-02-06 19:09:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:48,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837238381] [2025-02-06 19:09:48,922 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:48,937 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 123 statements into 11 equivalence classes. [2025-02-06 19:09:48,971 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 112 of 123 statements. [2025-02-06 19:09:48,971 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-02-06 19:09:48,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 200 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 19:09:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:09:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837238381] [2025-02-06 19:09:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837238381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:09:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557752023] [2025-02-06 19:09:49,105 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:09:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:09:49,108 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:09:49,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2025-02-06 19:09:49,254 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 123 statements into 11 equivalence classes. [2025-02-06 19:09:50,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 112 of 123 statements. [2025-02-06 19:09:50,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-02-06 19:09:50,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:09:50,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 19:09:50,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:09:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 200 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 19:09:50,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:09:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 200 proven. 10 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 19:09:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557752023] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:09:50,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:09:50,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-02-06 19:09:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079381931] [2025-02-06 19:09:50,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:09:50,137 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:09:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash -167647279, now seen corresponding path program 5 times [2025-02-06 19:09:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:50,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357296464] [2025-02-06 19:09:50,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:09:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:50,140 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:50,141 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:50,141 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:09:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:50,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:50,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:50,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:50,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:50,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:50,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:09:50,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 19:09:50,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-06 19:09:50,286 INFO L87 Difference]: Start difference. First operand 1199 states and 1488 transitions. cyclomatic complexity: 338 Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 19:09:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:09:50,338 INFO L93 Difference]: Finished difference Result 1255 states and 1544 transitions. [2025-02-06 19:09:50,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1255 states and 1544 transitions. [2025-02-06 19:09:50,341 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 222 [2025-02-06 19:09:50,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1255 states to 1255 states and 1544 transitions. [2025-02-06 19:09:50,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1022 [2025-02-06 19:09:50,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1022 [2025-02-06 19:09:50,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1255 states and 1544 transitions. [2025-02-06 19:09:50,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 19:09:50,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1255 states and 1544 transitions. [2025-02-06 19:09:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states and 1544 transitions. [2025-02-06 19:09:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1207. [2025-02-06 19:09:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1138 states have (on average 1.2126537785588751) internal successors, (1380), 1139 states have internal predecessors, (1380), 45 states have call successors, (46), 26 states have call predecessors, (46), 24 states have return successors, (70), 41 states have call predecessors, (70), 41 states have call successors, (70) [2025-02-06 19:09:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1496 transitions. [2025-02-06 19:09:50,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1207 states and 1496 transitions. [2025-02-06 19:09:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:09:50,354 INFO L432 stractBuchiCegarLoop]: Abstraction has 1207 states and 1496 transitions. [2025-02-06 19:09:50,354 INFO L338 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-02-06 19:09:50,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1207 states and 1496 transitions. [2025-02-06 19:09:50,357 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 222 [2025-02-06 19:09:50,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:09:50,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:09:50,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:50,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:09:50,358 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;" >"#39#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;" >"#37#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;" >"#39#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;" >"#39#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;" >"#39#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;" >"#37#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;" >"#37#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;" "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 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;" >"#37#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~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-06 19:09:50,358 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-06 19:09:50,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash 864720542, now seen corresponding path program 6 times [2025-02-06 19:09:50,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:50,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936571582] [2025-02-06 19:09:50,358 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:09:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:50,375 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 124 statements into 11 equivalence classes. [2025-02-06 19:09:50,489 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 19:09:50,490 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-02-06 19:09:50,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:50,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:50,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 19:09:50,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 19:09:50,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:50,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:50,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:50,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash -167647279, now seen corresponding path program 6 times [2025-02-06 19:09:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:50,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212148006] [2025-02-06 19:09:50,548 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:09:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:50,551 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:50,552 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:50,552 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:09:50,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:50,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:50,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 19:09:50,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:09:50,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:50,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:50,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:09:50,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:09:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash 949687956, now seen corresponding path program 7 times [2025-02-06 19:09:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:09:50,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628853754] [2025-02-06 19:09:50,556 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:09:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:09:50,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 19:09:50,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 19:09:50,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:50,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:50,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:09:50,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 19:09:50,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 19:09:50,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:09:50,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:09:50,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace