./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:23:02,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:23:02,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-19 14:23:02,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:23:02,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:23:02,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:23:02,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:23:02,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:23:02,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:23:02,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:23:02,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:23:02,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:23:02,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:23:02,209 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:23:02,210 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:23:02,210 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:23:02,211 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:23:02,211 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:23:02,211 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:23:02,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:23:02,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:23:02,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:23:02,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:23:02,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:23:02,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:23:02,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:23:02,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:23:02,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:23:02,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:23:02,216 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:23:02,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:23:02,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:23:02,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:23:02,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:23:02,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:23:02,217 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:23:02,217 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4 [2024-11-19 14:23:02,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:23:02,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:23:02,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:23:02,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:23:02,462 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:23:02,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2024-11-19 14:23:03,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:23:03,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:23:03,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2024-11-19 14:23:03,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45511ab5e/c001f28fa80b480bac5e1a6492032633/FLAG6bfca4e6d [2024-11-19 14:23:04,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45511ab5e/c001f28fa80b480bac5e1a6492032633 [2024-11-19 14:23:04,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:23:04,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:23:04,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:23:04,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:23:04,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:23:04,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40aa9932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04, skipping insertion in model container [2024-11-19 14:23:04,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:23:04,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:23:04,419 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:23:04,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:23:04,445 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:23:04,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04 WrapperNode [2024-11-19 14:23:04,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:23:04,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:23:04,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:23:04,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:23:04,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,477 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-11-19 14:23:04,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:23:04,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:23:04,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:23:04,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:23:04,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,509 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 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 [1, 2]. [2024-11-19 14:23:04,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:23:04,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:23:04,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:23:04,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:23:04,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (1/1) ... [2024-11-19 14:23:04,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:04,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:04,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:04,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 14:23:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:23:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:23:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2024-11-19 14:23:04,599 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2024-11-19 14:23:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 14:23:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:23:04,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:23:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:23:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:23:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:23:04,667 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:23:04,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:23:04,892 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-19 14:23:04,892 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:23:04,904 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:23:04,904 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 14:23:04,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:04 BoogieIcfgContainer [2024-11-19 14:23:04,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:23:04,906 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:23:04,906 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:23:04,909 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:23:04,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:04,909 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:23:04" (1/3) ... [2024-11-19 14:23:04,910 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@698260d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:23:04, skipping insertion in model container [2024-11-19 14:23:04,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:04,910 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:23:04" (2/3) ... [2024-11-19 14:23:04,911 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@698260d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:23:04, skipping insertion in model container [2024-11-19 14:23:04,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:23:04,911 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:23:04" (3/3) ... [2024-11-19 14:23:04,912 INFO L332 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2024-11-19 14:23:04,961 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:23:04,962 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:23:04,962 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:23:04,962 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:23:04,962 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:23:04,962 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:23:04,962 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:23:04,963 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:23:04,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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) [2024-11-19 14:23:04,982 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-19 14:23:04,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:04,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:04,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:23:04,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:04,987 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:23:04,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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) [2024-11-19 14:23:04,989 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-19 14:23:04,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:04,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:04,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 14:23:04,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:04,996 INFO L745 eck$LassoCheckResult]: Stem: 29#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true 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; 16#L35true 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; 10#L40-3true [2024-11-19 14:23:04,996 INFO L747 eck$LassoCheckResult]: Loop: 10#L40-3true assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 11#L40-2true main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10#L40-3true [2024-11-19 14:23:05,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times [2024-11-19 14:23:05,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:05,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977701919] [2024-11-19 14:23:05,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:05,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:05,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:05,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:05,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2024-11-19 14:23:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:05,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724324342] [2024-11-19 14:23:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:05,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:05,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:05,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:05,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times [2024-11-19 14:23:05,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:05,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289158658] [2024-11-19 14:23:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:05,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:05,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:05,379 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:05,380 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:05,380 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:05,380 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:05,380 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:05,380 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,380 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:05,380 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:05,381 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2024-11-19 14:23:05,381 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:05,381 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:05,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:05,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:05,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:05,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:05,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:05,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:05,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:05,699 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:05,703 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:05,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 14:23:05,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:05,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:05,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:05,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:05,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:05,726 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-19 14:23:05,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 14:23:05,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:05,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:05,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:05,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:05,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:05,755 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,769 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 14:23:05,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 [2024-11-19 14:23:05,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:05,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:05,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:05,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:05,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:05,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 14:23:05,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 [2024-11-19 14:23:05,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:05,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:05,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:05,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:05,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:05,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 14:23:05,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:05,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:05,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:05,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:05,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:05,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-19 14:23:05,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 14:23:05,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:05,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,873 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-19 14:23:05,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,878 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-19 14:23:05,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:05,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 14:23:05,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,898 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 14:23:05,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:05,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:05,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:05,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:05,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:05,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:23:05,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,932 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 14:23:05,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:05,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:05,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:05,950 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:05,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 14:23:05,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:05,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:05,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 14:23:05,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:05,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:05,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:05,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:05,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:05,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:05,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:05,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:05,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:05,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:05,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:06,000 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:06,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 14:23:06,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:06,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:06,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:06,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:06,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:06,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:06,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:06,034 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:06,064 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-19 14:23:06,064 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-19 14:23:06,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:06,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:06,067 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:06,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 14:23:06,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:06,082 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:23:06,082 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:06,083 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-11-19 14:23:06,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:06,100 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-19 14:23:06,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:06,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:23:06,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:06,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:23:06,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:06,194 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-19 14:23:06,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-19 14:23:06,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:06,263 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 62 states and 85 transitions. Complement of second has 7 states. [2024-11-19 14:23:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-19 14:23:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-11-19 14:23:06,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-19 14:23:06,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:06,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-19 14:23:06,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:06,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-19 14:23:06,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:06,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 85 transitions. [2024-11-19 14:23:06,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:06,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 28 states and 39 transitions. [2024-11-19 14:23:06,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-19 14:23:06,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-19 14:23:06,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2024-11-19 14:23:06,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:06,304 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-11-19 14:23:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2024-11-19 14:23:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 14:23:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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) [2024-11-19 14:23:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-11-19 14:23:06,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-11-19 14:23:06,325 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-11-19 14:23:06,325 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:23:06,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2024-11-19 14:23:06,325 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:06,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:06,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:06,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:23:06,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:06,326 INFO L745 eck$LassoCheckResult]: Stem: 164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 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; 148#L35 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; 150#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 151#L40-4 havoc main_~i~1#1; 137#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 138#$Ultimate##0 [2024-11-19 14:23:06,326 INFO L747 eck$LassoCheckResult]: Loop: 138#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 159#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 141#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 138#$Ultimate##0 [2024-11-19 14:23:06,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1630387501, now seen corresponding path program 1 times [2024-11-19 14:23:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700342325] [2024-11-19 14:23:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:06,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700342325] [2024-11-19 14:23:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700342325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:06,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:06,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:23:06,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282024155] [2024-11-19 14:23:06,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:06,413 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 1 times [2024-11-19 14:23:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024154330] [2024-11-19 14:23:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:06,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:06,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:23:06,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:23:06,636 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-19 14:23:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:06,651 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-19 14:23:06,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2024-11-19 14:23:06,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:06,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2024-11-19 14:23:06,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-19 14:23:06,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-19 14:23:06,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-19 14:23:06,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:06,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-19 14:23:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-19 14:23:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-19 14:23:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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) [2024-11-19 14:23:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-19 14:23:06,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-19 14:23:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:23:06,657 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-19 14:23:06,657 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:23:06,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2024-11-19 14:23:06,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:06,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:06,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:06,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:06,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:06,660 INFO L745 eck$LassoCheckResult]: Stem: 227#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 210#L-1 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; 211#L35 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; 213#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 214#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 215#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 216#L40-4 havoc main_~i~1#1; 200#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 201#$Ultimate##0 [2024-11-19 14:23:06,660 INFO L747 eck$LassoCheckResult]: Loop: 201#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 222#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 204#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 201#$Ultimate##0 [2024-11-19 14:23:06,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash 862387761, now seen corresponding path program 1 times [2024-11-19 14:23:06,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:06,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476656849] [2024-11-19 14:23:06,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:06,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:06,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:06,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 2 times [2024-11-19 14:23:06,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:06,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391946970] [2024-11-19 14:23:06,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:06,698 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:06,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:06,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:06,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:06,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1100576510, now seen corresponding path program 1 times [2024-11-19 14:23:06,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:06,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765848991] [2024-11-19 14:23:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:06,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:06,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765848991] [2024-11-19 14:23:06,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765848991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126502499] [2024-11-19 14:23:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:06,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:06,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:06,814 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:06,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 14:23:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:06,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:06,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:06,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:06,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126502499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:06,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-19 14:23:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852475577] [2024-11-19 14:23:06,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:23:07,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:23:07,105 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2024-11-19 14:23:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:07,154 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-19 14:23:07,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2024-11-19 14:23:07,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:07,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 31 states and 39 transitions. [2024-11-19 14:23:07,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-19 14:23:07,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-19 14:23:07,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2024-11-19 14:23:07,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:23:07,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-19 14:23:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2024-11-19 14:23:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-19 14:23:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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) [2024-11-19 14:23:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-19 14:23:07,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 14:23:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 14:23:07,160 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-19 14:23:07,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:23:07,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2024-11-19 14:23:07,161 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:07,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:07,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:07,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:07,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:07,161 INFO L745 eck$LassoCheckResult]: Stem: 368#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 350#L-1 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; 351#L35 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; 353#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 354#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 355#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 356#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 369#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 367#L40-4 havoc main_~i~1#1; 340#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 341#$Ultimate##0 [2024-11-19 14:23:07,161 INFO L747 eck$LassoCheckResult]: Loop: 341#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 362#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 343#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 341#$Ultimate##0 [2024-11-19 14:23:07,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash -172336625, now seen corresponding path program 2 times [2024-11-19 14:23:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212997923] [2024-11-19 14:23:07,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:07,177 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:07,178 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:07,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:07,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:07,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 3 times [2024-11-19 14:23:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633764768] [2024-11-19 14:23:07,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:07,197 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:07,197 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:07,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:07,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:07,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:07,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1594476444, now seen corresponding path program 2 times [2024-11-19 14:23:07,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:07,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360300733] [2024-11-19 14:23:07,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:07,224 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:07,224 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:07,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:07,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:07,753 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:07,753 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:07,753 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:07,753 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:07,753 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:07,753 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:07,753 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:07,753 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:07,753 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2024-11-19 14:23:07,753 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:07,753 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:07,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:07,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:08,260 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:08,261 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,262 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 14:23:08,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 14:23:08,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,289 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 14:23:08,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 [2024-11-19 14:23:08,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,316 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 14:23:08,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 14:23:08,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,342 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 14:23:08,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 [2024-11-19 14:23:08,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,359 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 14:23:08,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 14:23:08,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:23:08,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,402 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 14:23:08,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 [2024-11-19 14:23:08,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,430 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:23:08,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,463 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:23:08,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,489 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 14:23:08,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-19 14:23:08,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,524 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 14:23:08,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-19 14:23:08,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,552 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 14:23:08,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,577 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 14:23:08,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,601 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 14:23:08,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,614 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,625 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 14:23:08,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 14:23:08,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,649 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 14:23:08,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,675 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 14:23:08,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,690 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-19 14:23:08,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,703 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-19 14:23:08,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 [2024-11-19 14:23:08,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,732 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-19 14:23:08,735 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,762 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-19 14:23:08,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-19 14:23:08,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,788 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-19 14:23:08,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-19 14:23:08,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,813 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-19 14:23:08,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-19 14:23:08,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,840 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-19 14:23:08,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,868 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-19 14:23:08,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-19 14:23:08,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,894 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-19 14:23:08,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,907 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,918 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-19 14:23:08,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-19 14:23:08,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,942 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-19 14:23:08,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 [2024-11-19 14:23:08,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,966 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-19 14:23:08,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:08,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:08,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:08,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:08,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:08,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:08,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:08,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:08,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:08,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:08,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:08,990 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:08,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-19 14:23:08,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,005 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,017 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-19 14:23:09,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,042 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-19 14:23:09,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,068 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-19 14:23:09,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-19 14:23:09,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,092 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-19 14:23:09,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,118 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-19 14:23:09,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-19 14:23:09,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,142 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-19 14:23:09,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 [2024-11-19 14:23:09,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-19 14:23:09,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,167 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-19 14:23:09,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,192 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-19 14:23:09,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 [2024-11-19 14:23:09,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,206 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,218 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-19 14:23:09,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,242 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-19 14:23:09,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 [2024-11-19 14:23:09,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-19 14:23:09,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,266 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-19 14:23:09,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 [2024-11-19 14:23:09,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-19 14:23:09,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,290 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-19 14:23:09,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 [2024-11-19 14:23:09,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:09,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:09,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:09,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,313 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-19 14:23:09,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:09,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:09,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-19 14:23:09,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,345 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-19 14:23:09,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 [2024-11-19 14:23:09,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,357 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-19 14:23:09,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,359 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-19 14:23:09,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:09,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,373 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-19 14:23:09,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 [2024-11-19 14:23:09,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:09,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:09,390 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:09,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-19 14:23:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,401 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-19 14:23:09,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:09,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:09,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:09,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:09,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:09,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:09,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:09,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:09,433 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-19 14:23:09,433 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-19 14:23:09,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:09,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,435 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-19 14:23:09,436 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:09,446 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:23:09,446 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:09,446 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2024-11-19 14:23:09,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:09,465 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2024-11-19 14:23:09,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:09,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:23:09,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:09,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:23:09,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:09,551 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 [2024-11-19 14:23:09,551 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-19 14:23:09,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 48 states and 60 transitions. Complement of second has 16 states. [2024-11-19 14:23:09,599 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 [2024-11-19 14:23:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-19 14:23:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-19 14:23:09,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 3 letters. [2024-11-19 14:23:09,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:09,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2024-11-19 14:23:09,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:09,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2024-11-19 14:23:09,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:09,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2024-11-19 14:23:09,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:09,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 51 transitions. [2024-11-19 14:23:09,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-19 14:23:09,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-19 14:23:09,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2024-11-19 14:23:09,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:09,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-19 14:23:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2024-11-19 14:23:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-19 14:23:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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) [2024-11-19 14:23:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-19 14:23:09,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-19 14:23:09,613 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-19 14:23:09,613 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:23:09,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2024-11-19 14:23:09,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-19 14:23:09,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:09,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:09,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:09,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:09,614 INFO L745 eck$LassoCheckResult]: Stem: 534#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 512#L-1 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; 513#L35 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; 515#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 516#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 517#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 518#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 535#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 533#L40-4 havoc main_~i~1#1; 501#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 502#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 527#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 505#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 526#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 528#L24 assume ~n#1 < 2; 524#merge_sortFINAL assume true; 523#merge_sortEXIT >#88#return; 504#L27-1 [2024-11-19 14:23:09,615 INFO L747 eck$LassoCheckResult]: Loop: 504#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 525#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 537#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 506#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 525#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 537#L24 assume ~n#1 < 2; 514#merge_sortFINAL assume true; 536#merge_sortEXIT >#88#return; 504#L27-1 [2024-11-19 14:23:09,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1352366372, now seen corresponding path program 1 times [2024-11-19 14:23:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771775493] [2024-11-19 14:23:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:09,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:09,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:09,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1121289573, now seen corresponding path program 1 times [2024-11-19 14:23:09,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:09,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060442774] [2024-11-19 14:23:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:09,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:09,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:09,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash -526901058, now seen corresponding path program 1 times [2024-11-19 14:23:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041366770] [2024-11-19 14:23:09,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:09,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-19 14:23:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:23:09,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041366770] [2024-11-19 14:23:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041366770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810652476] [2024-11-19 14:23:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:09,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:09,917 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:09,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2024-11-19 14:23:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:09,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:23:09,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:10,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:23:10,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810652476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:10,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:10,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2024-11-19 14:23:10,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391179956] [2024-11-19 14:23:10,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 14:23:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-19 14:23:10,436 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. cyclomatic complexity: 15 Second operand has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 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) [2024-11-19 14:23:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:10,549 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2024-11-19 14:23:10,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2024-11-19 14:23:10,554 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-19 14:23:10,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 66 states and 81 transitions. [2024-11-19 14:23:10,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-19 14:23:10,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-19 14:23:10,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 81 transitions. [2024-11-19 14:23:10,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:10,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-19 14:23:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 81 transitions. [2024-11-19 14:23:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-11-19 14:23:10,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 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) [2024-11-19 14:23:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-11-19 14:23:10,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-19 14:23:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 14:23:10,564 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-11-19 14:23:10,564 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:23:10,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 80 transitions. [2024-11-19 14:23:10,565 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-19 14:23:10,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:10,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:10,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:10,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:10,566 INFO L745 eck$LassoCheckResult]: Stem: 816#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 790#L-1 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; 791#L35 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; 793#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 794#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 795#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 796#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 836#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 834#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 833#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 832#L40-4 havoc main_~i~1#1; 784#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 830#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 810#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 781#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 806#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 809#L24 assume ~n#1 < 2; 831#merge_sortFINAL assume true; 827#merge_sortEXIT >#88#return; 783#L27-1 [2024-11-19 14:23:10,566 INFO L747 eck$LassoCheckResult]: Loop: 783#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 825#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 835#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 782#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 825#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 835#L24 assume ~n#1 < 2; 792#merge_sortFINAL assume true; 824#merge_sortEXIT >#88#return; 783#L27-1 [2024-11-19 14:23:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1854838534, now seen corresponding path program 2 times [2024-11-19 14:23:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657371468] [2024-11-19 14:23:10,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:10,580 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:10,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:10,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:10,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:10,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1121289573, now seen corresponding path program 2 times [2024-11-19 14:23:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:10,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369529370] [2024-11-19 14:23:10,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:10,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:10,602 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:10,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:10,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:10,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash 8928416, now seen corresponding path program 2 times [2024-11-19 14:23:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:10,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783669546] [2024-11-19 14:23:10,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:10,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:10,634 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:10,634 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:10,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:10,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:11,612 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:11,612 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:11,612 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:11,612 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:11,613 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:11,613 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:11,613 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:11,613 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:11,613 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2024-11-19 14:23:11,613 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:11,613 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:11,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:11,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:12,154 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:12,154 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:12,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,156 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:12,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-19 14:23:12,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 [2024-11-19 14:23:12,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:12,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:12,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:12,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:12,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:12,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:12,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:12,169 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:12,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:12,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,180 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:12,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-19 14:23:12,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 [2024-11-19 14:23:12,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:12,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:12,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:12,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:12,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:12,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:12,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:12,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:12,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-19 14:23:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,207 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:12,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-19 14:23:12,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:12,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:12,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:12,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:12,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:12,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:12,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:12,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:12,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-19 14:23:12,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,234 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:12,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-19 14:23:12,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:12,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:12,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:12,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:12,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:12,251 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:12,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:12,263 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:12,284 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-19 14:23:12,284 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 14:23:12,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:12,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:12,287 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:12,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-19 14:23:12,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:12,300 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:23:12,300 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:12,300 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~m~0#1, merge_sort_~n#1) = -1*merge_sort_~m~0#1 + 1*merge_sort_~n#1 Supporting invariants [] [2024-11-19 14:23:12,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-19 14:23:12,313 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-19 14:23:12,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:12,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:12,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:12,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:23:12,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:12,474 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2024-11-19 14:23:12,474 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22 Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 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) [2024-11-19 14:23:12,582 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 80 transitions. cyclomatic complexity: 22. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 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 184 states and 243 transitions. Complement of second has 28 states. [2024-11-19 14:23:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 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) [2024-11-19 14:23:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2024-11-19 14:23:12,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 19 letters. Loop has 8 letters. [2024-11-19 14:23:12,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:12,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 27 letters. Loop has 8 letters. [2024-11-19 14:23:12,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:12,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 19 letters. Loop has 16 letters. [2024-11-19 14:23:12,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:12,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 243 transitions. [2024-11-19 14:23:12,591 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 48 [2024-11-19 14:23:12,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 171 states and 230 transitions. [2024-11-19 14:23:12,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2024-11-19 14:23:12,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2024-11-19 14:23:12,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 230 transitions. [2024-11-19 14:23:12,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:12,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 171 states and 230 transitions. [2024-11-19 14:23:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 230 transitions. [2024-11-19 14:23:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2024-11-19 14:23:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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) [2024-11-19 14:23:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 208 transitions. [2024-11-19 14:23:12,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 159 states and 208 transitions. [2024-11-19 14:23:12,617 INFO L425 stractBuchiCegarLoop]: Abstraction has 159 states and 208 transitions. [2024-11-19 14:23:12,617 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:23:12,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 208 transitions. [2024-11-19 14:23:12,618 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 48 [2024-11-19 14:23:12,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:12,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:12,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:12,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:23:12,619 INFO L745 eck$LassoCheckResult]: Stem: 1241#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1191#L-1 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; 1192#L35 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; 1196#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 1197#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1198#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 1199#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1261#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1262#L40-4 havoc main_~i~1#1; 1166#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1167#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1290#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1287#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1288#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1291#L24 assume ~n#1 < 2; 1289#merge_sortFINAL assume true; 1286#merge_sortEXIT >#88#return; 1280#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1281#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1285#L24 assume ~n#1 < 2; 1284#merge_sortFINAL assume true; 1279#merge_sortEXIT >#90#return; 1205#L28 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; 1206#L11-3 [2024-11-19 14:23:12,619 INFO L747 eck$LassoCheckResult]: Loop: 1206#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1228#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 1276#L12-2 call write~int#0(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; 1237#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1206#L11-3 [2024-11-19 14:23:12,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash 178168560, now seen corresponding path program 1 times [2024-11-19 14:23:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080619117] [2024-11-19 14:23:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:12,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2024-11-19 14:23:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068663989] [2024-11-19 14:23:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:12,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:12,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2084911979, now seen corresponding path program 1 times [2024-11-19 14:23:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421614060] [2024-11-19 14:23:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:12,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:12,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:12,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421614060] [2024-11-19 14:23:12,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421614060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:12,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:12,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:23:12,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449537745] [2024-11-19 14:23:12,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:12,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:23:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:23:12,855 INFO L87 Difference]: Start difference. First operand 159 states and 208 transitions. cyclomatic complexity: 67 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) [2024-11-19 14:23:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:12,881 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2024-11-19 14:23:12,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 273 transitions. [2024-11-19 14:23:12,883 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 80 [2024-11-19 14:23:12,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 213 states and 273 transitions. [2024-11-19 14:23:12,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2024-11-19 14:23:12,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2024-11-19 14:23:12,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 273 transitions. [2024-11-19 14:23:12,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:12,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 213 states and 273 transitions. [2024-11-19 14:23:12,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 273 transitions. [2024-11-19 14:23:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 195. [2024-11-19 14:23:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 166 states have (on average 1.2590361445783131) internal successors, (209), 166 states have internal predecessors, (209), 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) [2024-11-19 14:23:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 250 transitions. [2024-11-19 14:23:12,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 195 states and 250 transitions. [2024-11-19 14:23:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:23:12,895 INFO L425 stractBuchiCegarLoop]: Abstraction has 195 states and 250 transitions. [2024-11-19 14:23:12,896 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:23:12,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 250 transitions. [2024-11-19 14:23:12,897 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 72 [2024-11-19 14:23:12,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:12,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:12,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:12,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:12,898 INFO L745 eck$LassoCheckResult]: Stem: 1633#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1571#L-1 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; 1572#L35 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; 1576#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 1577#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1578#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 1579#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1659#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1658#L40-4 havoc main_~i~1#1; 1547#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1548#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1685#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1681#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1683#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1690#L24 assume ~n#1 < 2; 1680#merge_sortFINAL assume true; 1682#merge_sortEXIT >#88#return; 1598#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1608#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1609#L24 assume ~n#1 < 2; 1597#merge_sortFINAL assume true; 1599#merge_sortEXIT >#90#return; 1709#L28 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; 1698#L11-3 [2024-11-19 14:23:12,899 INFO L747 eck$LassoCheckResult]: Loop: 1698#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1699#L12 assume !(merge_~j~0#1 == merge_~n#1); 1726#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 1729#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 1728#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 1727#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 1714#L12-2 call write~int#0(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; 1715#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1698#L11-3 [2024-11-19 14:23:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 178168560, now seen corresponding path program 2 times [2024-11-19 14:23:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963090757] [2024-11-19 14:23:12,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,915 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:12,915 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:12,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:12,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2024-11-19 14:23:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602725019] [2024-11-19 14:23:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:12,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1066528190, now seen corresponding path program 1 times [2024-11-19 14:23:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681243874] [2024-11-19 14:23:12,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:12,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:14,081 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:14,082 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:14,082 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:14,082 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:14,082 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:14,082 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,082 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:14,082 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:14,082 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2024-11-19 14:23:14,082 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:14,082 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:14,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:14,835 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:14,835 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:14,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,837 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-19 14:23:14,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-19 14:23:14,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,863 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2024-11-19 14:23:14,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 [2024-11-19 14:23:14,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-11-19 14:23:14,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,887 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-19 14:23:14,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-19 14:23:14,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,911 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-19 14:23:14,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 [2024-11-19 14:23:14,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,924 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:14,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,935 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-19 14:23:14,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-19 14:23:14,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,958 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-19 14:23:14,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:14,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-19 14:23:14,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:14,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:14,982 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:14,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-19 14:23:14,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:14,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:14,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:14,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:14,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:14,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:14,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:14,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:14,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:15,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-19 14:23:15,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:15,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:15,005 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:15,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-19 14:23:15,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:15,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:15,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:15,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:15,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:15,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:15,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:15,027 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:15,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-19 14:23:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:15,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:15,039 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:15,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-19 14:23:15,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 [2024-11-19 14:23:15,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:15,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:15,052 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-19 14:23:15,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:15,092 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-11-19 14:23:15,093 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-19 14:23:15,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:16,254 INFO L443 ModelExtractionUtils]: Simplification made 66 calls to the SMT solver. [2024-11-19 14:23:16,254 INFO L444 ModelExtractionUtils]: 15 out of 100 variables were initially zero. Simplification set additionally 73 variables to zero. [2024-11-19 14:23:16,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:16,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:16,255 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:16,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-19 14:23:16,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:16,270 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 8. [2024-11-19 14:23:16,270 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:16,270 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a#1.offset, v_rep(select #length merge_sort_merge_~a#1.base)_1, merge_sort_merge_~k~0#1) = -1*merge_sort_merge_~a#1.offset + 2*v_rep(select #length merge_sort_merge_~a#1.base)_1 - 4*merge_sort_merge_~k~0#1 Supporting invariants [1*v_rep(select #length merge_sort_#in~a#1.base)_3 + 4*merge_sort_merge_~i~0#1 + 1*merge_sort_merge_~x~0#1.offset - 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 >= 0, -1*merge_sort_merge_~a#1.offset + 1*merge_sort_merge_~x~0#1.offset - 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_1 + 8 >= 0] [2024-11-19 14:23:16,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:16,308 INFO L156 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2024-11-19 14:23:16,310 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2024-11-19 14:23:16,311 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:23:16,311 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:23:16,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:16,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 14:23:16,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:16,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:23:16,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:16,646 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 3 loop predicates [2024-11-19 14:23:16,646 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 250 transitions. cyclomatic complexity: 73 Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 14:23:16,900 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 250 transitions. cyclomatic complexity: 73. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 263 states and 356 transitions. Complement of second has 21 states. [2024-11-19 14:23:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 9 stem states 3 non-accepting loop states 2 accepting loop states [2024-11-19 14:23:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 14:23:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2024-11-19 14:23:16,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 44 transitions. Stem has 23 letters. Loop has 8 letters. [2024-11-19 14:23:16,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:16,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 44 transitions. Stem has 31 letters. Loop has 8 letters. [2024-11-19 14:23:16,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:16,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 44 transitions. Stem has 23 letters. Loop has 16 letters. [2024-11-19 14:23:16,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:16,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 356 transitions. [2024-11-19 14:23:16,904 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 62 [2024-11-19 14:23:16,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 251 states and 340 transitions. [2024-11-19 14:23:16,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2024-11-19 14:23:16,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2024-11-19 14:23:16,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 340 transitions. [2024-11-19 14:23:16,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:16,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 251 states and 340 transitions. [2024-11-19 14:23:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 340 transitions. [2024-11-19 14:23:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 196. [2024-11-19 14:23:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 167 states have (on average 1.2634730538922156) internal successors, (211), 167 states have internal predecessors, (211), 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) [2024-11-19 14:23:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 252 transitions. [2024-11-19 14:23:16,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 252 transitions. [2024-11-19 14:23:16,917 INFO L425 stractBuchiCegarLoop]: Abstraction has 196 states and 252 transitions. [2024-11-19 14:23:16,917 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:23:16,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 252 transitions. [2024-11-19 14:23:16,918 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 58 [2024-11-19 14:23:16,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:16,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:16,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:16,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:16,919 INFO L745 eck$LassoCheckResult]: Stem: 2291#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2238#L-1 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; 2239#L35 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; 2244#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 2245#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2246#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 2247#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2301#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2286#L40-4 havoc main_~i~1#1; 2273#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2318#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2316#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2312#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2313#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2317#L24 assume ~n#1 < 2; 2315#merge_sortFINAL assume true; 2311#merge_sortEXIT >#88#return; 2308#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2309#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2314#L24 assume ~n#1 < 2; 2310#merge_sortFINAL assume true; 2307#merge_sortEXIT >#90#return; 2306#L28 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; 2305#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 2274#L11-4 merge_~i~0#1 := 0; 2281#L17-3 [2024-11-19 14:23:16,919 INFO L747 eck$LassoCheckResult]: Loop: 2281#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 2282#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 2281#L17-3 [2024-11-19 14:23:16,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash -578705235, now seen corresponding path program 1 times [2024-11-19 14:23:16,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:16,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063726986] [2024-11-19 14:23:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:16,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:16,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063726986] [2024-11-19 14:23:16,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063726986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:16,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:16,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:23:16,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965362512] [2024-11-19 14:23:16,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:16,978 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:16,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2024-11-19 14:23:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:16,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57490318] [2024-11-19 14:23:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:16,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:16,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:23:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:23:17,034 INFO L87 Difference]: Start difference. First operand 196 states and 252 transitions. cyclomatic complexity: 74 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2024-11-19 14:23:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:17,055 INFO L93 Difference]: Finished difference Result 267 states and 334 transitions. [2024-11-19 14:23:17,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 334 transitions. [2024-11-19 14:23:17,056 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 58 [2024-11-19 14:23:17,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 267 states and 334 transitions. [2024-11-19 14:23:17,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2024-11-19 14:23:17,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2024-11-19 14:23:17,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 334 transitions. [2024-11-19 14:23:17,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:17,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 267 states and 334 transitions. [2024-11-19 14:23:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 334 transitions. [2024-11-19 14:23:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 201. [2024-11-19 14:23:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 172 states have (on average 1.25) internal successors, (215), 172 states have internal predecessors, (215), 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) [2024-11-19 14:23:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 256 transitions. [2024-11-19 14:23:17,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 256 transitions. [2024-11-19 14:23:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:23:17,076 INFO L425 stractBuchiCegarLoop]: Abstraction has 201 states and 256 transitions. [2024-11-19 14:23:17,076 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:23:17,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 256 transitions. [2024-11-19 14:23:17,077 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 58 [2024-11-19 14:23:17,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:17,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:17,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:17,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:17,078 INFO L745 eck$LassoCheckResult]: Stem: 2758#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2700#L-1 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; 2701#L35 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; 2705#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 2706#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2707#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 2708#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2780#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 2709#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2710#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2755#L40-4 havoc main_~i~1#1; 2682#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2790#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2737#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2681#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2731#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2736#L24 assume ~n#1 < 2; 2777#merge_sortFINAL assume true; 2776#merge_sortEXIT >#88#return; 2683#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2772#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2811#L24 assume ~n#1 < 2; 2809#merge_sortFINAL assume true; 2802#merge_sortEXIT >#90#return; 2801#L28 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; 2853#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2822#L12 [2024-11-19 14:23:17,078 INFO L747 eck$LassoCheckResult]: Loop: 2822#L12 assume !(merge_~j~0#1 == merge_~n#1); 2837#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 2851#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 2852#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 2838#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 2832#L12-2 call write~int#0(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; 2833#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 2821#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2822#L12 [2024-11-19 14:23:17,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1522637565, now seen corresponding path program 1 times [2024-11-19 14:23:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:17,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901353141] [2024-11-19 14:23:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 14:23:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901353141] [2024-11-19 14:23:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901353141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248198381] [2024-11-19 14:23:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:17,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:17,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:17,250 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:17,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2024-11-19 14:23:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:17,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:23:17,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:23:17,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:23:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248198381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:17,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:17,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-11-19 14:23:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036446803] [2024-11-19 14:23:17,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:17,485 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 2 times [2024-11-19 14:23:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:17,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999730122] [2024-11-19 14:23:17,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:17,492 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:17,492 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:17,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:17,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 14:23:17,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 14:23:17,644 INFO L87 Difference]: Start difference. First operand 201 states and 256 transitions. cyclomatic complexity: 73 Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 14:23:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:17,812 INFO L93 Difference]: Finished difference Result 239 states and 311 transitions. [2024-11-19 14:23:17,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 311 transitions. [2024-11-19 14:23:17,814 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 74 [2024-11-19 14:23:17,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 235 states and 306 transitions. [2024-11-19 14:23:17,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2024-11-19 14:23:17,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2024-11-19 14:23:17,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 306 transitions. [2024-11-19 14:23:17,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:17,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 235 states and 306 transitions. [2024-11-19 14:23:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 306 transitions. [2024-11-19 14:23:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 223. [2024-11-19 14:23:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 190 states have (on average 1.2526315789473683) internal successors, (238), 191 states have internal predecessors, (238), 22 states have call successors, (24), 13 states have call predecessors, (24), 11 states have return successors, (26), 18 states have call predecessors, (26), 20 states have call successors, (26) [2024-11-19 14:23:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 288 transitions. [2024-11-19 14:23:17,828 INFO L240 hiAutomatonCegarLoop]: Abstraction has 223 states and 288 transitions. [2024-11-19 14:23:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 14:23:17,830 INFO L425 stractBuchiCegarLoop]: Abstraction has 223 states and 288 transitions. [2024-11-19 14:23:17,830 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:23:17,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 288 transitions. [2024-11-19 14:23:17,832 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 72 [2024-11-19 14:23:17,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:17,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:17,832 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:17,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:17,833 INFO L745 eck$LassoCheckResult]: Stem: 3376#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3326#L-1 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; 3327#L35 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; 3330#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 3331#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3332#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 3333#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3389#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 3391#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3393#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3373#L40-4 havoc main_~i~1#1; 3360#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3397#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3398#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3298#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3346#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3385#L24 assume ~n#1 < 2; 3384#merge_sortFINAL assume true; 3383#merge_sortEXIT >#88#return; 3297#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3358#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3382#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3319#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3381#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3482#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3316#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3345#$Ultimate##0 [2024-11-19 14:23:17,833 INFO L747 eck$LassoCheckResult]: Loop: 3345#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3350#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3313#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3345#$Ultimate##0 [2024-11-19 14:23:17,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1524308723, now seen corresponding path program 3 times [2024-11-19 14:23:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561207993] [2024-11-19 14:23:17,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:17,868 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:23:17,870 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:18,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561207993] [2024-11-19 14:23:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561207993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506535307] [2024-11-19 14:23:18,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:18,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:18,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:18,084 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:18,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2024-11-19 14:23:18,136 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:23:18,136 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:18,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:23:18,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:18,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506535307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:18,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:18,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2024-11-19 14:23:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509848720] [2024-11-19 14:23:18,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:18,319 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:18,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 4 times [2024-11-19 14:23:18,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:18,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883394019] [2024-11-19 14:23:18,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:18,322 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:18,322 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:18,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:18,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:18,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:18,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 14:23:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-11-19 14:23:18,441 INFO L87 Difference]: Start difference. First operand 223 states and 288 transitions. cyclomatic complexity: 84 Second operand has 24 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 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) [2024-11-19 14:23:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:18,661 INFO L93 Difference]: Finished difference Result 378 states and 480 transitions. [2024-11-19 14:23:18,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 480 transitions. [2024-11-19 14:23:18,664 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 136 [2024-11-19 14:23:18,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 372 states and 473 transitions. [2024-11-19 14:23:18,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2024-11-19 14:23:18,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2024-11-19 14:23:18,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 473 transitions. [2024-11-19 14:23:18,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:18,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 372 states and 473 transitions. [2024-11-19 14:23:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 473 transitions. [2024-11-19 14:23:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 333. [2024-11-19 14:23:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 275 states have (on average 1.2363636363636363) internal successors, (340), 279 states have internal predecessors, (340), 38 states have call successors, (41), 25 states have call predecessors, (41), 20 states have return successors, (43), 28 states have call predecessors, (43), 34 states have call successors, (43) [2024-11-19 14:23:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 424 transitions. [2024-11-19 14:23:18,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 333 states and 424 transitions. [2024-11-19 14:23:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 14:23:18,679 INFO L425 stractBuchiCegarLoop]: Abstraction has 333 states and 424 transitions. [2024-11-19 14:23:18,679 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:23:18,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 424 transitions. [2024-11-19 14:23:18,681 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 104 [2024-11-19 14:23:18,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:18,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:18,681 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:18,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:18,682 INFO L745 eck$LassoCheckResult]: Stem: 4179#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4111#L-1 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; 4112#L35 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; 4120#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 4121#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4122#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 4123#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4235#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4178#L40-4 havoc main_~i~1#1; 4093#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4254#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4253#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4250#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4251#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4255#L24 assume ~n#1 < 2; 4252#merge_sortFINAL assume true; 4249#merge_sortEXIT >#88#return; 4243#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4244#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4248#L24 assume ~n#1 < 2; 4247#merge_sortFINAL assume true; 4242#merge_sortEXIT >#90#return; 4241#L28 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; 4240#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 4125#L12 assume !(merge_~j~0#1 == merge_~n#1); 4109#L13 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 4094#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 4181#L12-2 call write~int#0(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; 4183#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 4151#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 4152#L11-4 merge_~i~0#1 := 0; 4163#L17-3 [2024-11-19 14:23:18,682 INFO L747 eck$LassoCheckResult]: Loop: 4163#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 4164#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 4163#L17-3 [2024-11-19 14:23:18,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1013086271, now seen corresponding path program 1 times [2024-11-19 14:23:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:18,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731039362] [2024-11-19 14:23:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:18,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731039362] [2024-11-19 14:23:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731039362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:18,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:23:18,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:23:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781430762] [2024-11-19 14:23:18,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:18,785 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:18,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2024-11-19 14:23:18,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:18,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273475811] [2024-11-19 14:23:18,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:18,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:18,789 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:18,789 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:18,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:18,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:23:18,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:23:18,842 INFO L87 Difference]: Start difference. First operand 333 states and 424 transitions. cyclomatic complexity: 114 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2024-11-19 14:23:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:18,860 INFO L93 Difference]: Finished difference Result 404 states and 513 transitions. [2024-11-19 14:23:18,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 513 transitions. [2024-11-19 14:23:18,864 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 140 [2024-11-19 14:23:18,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 404 states and 513 transitions. [2024-11-19 14:23:18,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2024-11-19 14:23:18,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2024-11-19 14:23:18,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 404 states and 513 transitions. [2024-11-19 14:23:18,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:18,868 INFO L218 hiAutomatonCegarLoop]: Abstraction has 404 states and 513 transitions. [2024-11-19 14:23:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 513 transitions. [2024-11-19 14:23:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2024-11-19 14:23:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 338 states have (on average 1.2455621301775148) internal successors, (421), 342 states have internal predecessors, (421), 38 states have call successors, (41), 25 states have call predecessors, (41), 20 states have return successors, (43), 28 states have call predecessors, (43), 34 states have call successors, (43) [2024-11-19 14:23:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 505 transitions. [2024-11-19 14:23:18,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 396 states and 505 transitions. [2024-11-19 14:23:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:23:18,879 INFO L425 stractBuchiCegarLoop]: Abstraction has 396 states and 505 transitions. [2024-11-19 14:23:18,879 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 14:23:18,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 505 transitions. [2024-11-19 14:23:18,881 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 140 [2024-11-19 14:23:18,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:18,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:18,882 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:18,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:18,883 INFO L745 eck$LassoCheckResult]: Stem: 4921#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4854#L-1 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; 4855#L35 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; 4860#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 4861#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4862#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 4863#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4963#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4920#L40-4 havoc main_~i~1#1; 4836#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5019#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5018#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 5014#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5015#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5020#L24 assume ~n#1 < 2; 5017#merge_sortFINAL assume true; 5013#merge_sortEXIT >#88#return; 5010#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5011#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5016#L24 assume ~n#1 < 2; 5012#merge_sortFINAL assume true; 5009#merge_sortEXIT >#90#return; 5007#L28 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; 5005#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 5004#L12 assume !(merge_~j~0#1 == merge_~n#1); 4992#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 4887#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 4835#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 4837#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 5008#L12-2 call write~int#0(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; 4916#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 4917#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 4898#L11-4 merge_~i~0#1 := 0; 4907#L17-3 [2024-11-19 14:23:18,883 INFO L747 eck$LassoCheckResult]: Loop: 4907#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 4909#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 4907#L17-3 [2024-11-19 14:23:18,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:18,883 INFO L85 PathProgramCache]: Analyzing trace with hash 956367225, now seen corresponding path program 1 times [2024-11-19 14:23:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:18,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731644417] [2024-11-19 14:23:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:18,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731644417] [2024-11-19 14:23:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731644417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187708347] [2024-11-19 14:23:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:18,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:18,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:18,949 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:18,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2024-11-19 14:23:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:19,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:19,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:19,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187708347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:19,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-19 14:23:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267668736] [2024-11-19 14:23:19,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:19,079 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:19,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2024-11-19 14:23:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:19,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738237678] [2024-11-19 14:23:19,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:19,083 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:19,083 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:19,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:19,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:23:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:23:19,122 INFO L87 Difference]: Start difference. First operand 396 states and 505 transitions. cyclomatic complexity: 132 Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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) [2024-11-19 14:23:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:19,154 INFO L93 Difference]: Finished difference Result 648 states and 793 transitions. [2024-11-19 14:23:19,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 793 transitions. [2024-11-19 14:23:19,161 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 140 [2024-11-19 14:23:19,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 648 states and 793 transitions. [2024-11-19 14:23:19,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2024-11-19 14:23:19,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 450 [2024-11-19 14:23:19,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 648 states and 793 transitions. [2024-11-19 14:23:19,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:19,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 648 states and 793 transitions. [2024-11-19 14:23:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states and 793 transitions. [2024-11-19 14:23:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 504. [2024-11-19 14:23:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 446 states have (on average 1.2062780269058295) internal successors, (538), 450 states have internal predecessors, (538), 38 states have call successors, (41), 25 states have call predecessors, (41), 20 states have return successors, (43), 28 states have call predecessors, (43), 34 states have call successors, (43) [2024-11-19 14:23:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 622 transitions. [2024-11-19 14:23:19,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 504 states and 622 transitions. [2024-11-19 14:23:19,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:23:19,181 INFO L425 stractBuchiCegarLoop]: Abstraction has 504 states and 622 transitions. [2024-11-19 14:23:19,182 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-19 14:23:19,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 622 transitions. [2024-11-19 14:23:19,183 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 140 [2024-11-19 14:23:19,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:19,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:19,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:19,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:19,185 INFO L745 eck$LassoCheckResult]: Stem: 6176#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6109#L-1 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; 6110#L35 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; 6115#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 6116#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6117#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 6118#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6211#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6175#L40-4 havoc main_~i~1#1; 6077#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6078#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6365#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6366#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6381#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6384#L24 assume ~n#1 < 2; 6382#merge_sortFINAL assume true; 6377#merge_sortEXIT >#88#return; 6378#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6399#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6401#L24 assume ~n#1 < 2; 6400#merge_sortFINAL assume true; 6398#merge_sortEXIT >#90#return; 6397#L28 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; 6395#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6396#L12 assume !(merge_~j~0#1 == merge_~n#1); 6391#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6392#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 6479#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 6478#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6477#L12-2 call write~int#0(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; 6475#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6472#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6473#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 6182#L12-2 call write~int#0(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; 6183#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6226#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 6221#L11-4 merge_~i~0#1 := 0; 6161#L17-3 [2024-11-19 14:23:19,186 INFO L747 eck$LassoCheckResult]: Loop: 6161#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 6164#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 6161#L17-3 [2024-11-19 14:23:19,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash -412481570, now seen corresponding path program 1 times [2024-11-19 14:23:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:19,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76860619] [2024-11-19 14:23:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:19,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:19,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:19,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:19,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2024-11-19 14:23:19,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:19,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665208260] [2024-11-19 14:23:19,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:19,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:19,229 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:19,230 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:19,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:19,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1257795936, now seen corresponding path program 1 times [2024-11-19 14:23:19,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:19,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242781433] [2024-11-19 14:23:19,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:19,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:19,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:20,549 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:20,550 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:20,550 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:20,550 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:20,550 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:20,550 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:20,550 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:20,550 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:20,550 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration14_Lasso [2024-11-19 14:23:20,550 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:20,550 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:20,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:20,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:21,281 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:21,281 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,283 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-19 14:23:21,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,311 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-19 14:23:21,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,338 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-19 14:23:21,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,363 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-19 14:23:21,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-19 14:23:21,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,386 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2024-11-19 14:23:21,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2024-11-19 14:23:21,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,409 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2024-11-19 14:23:21,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2024-11-19 14:23:21,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,431 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2024-11-19 14:23:21,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-19 14:23:21,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,456 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2024-11-19 14:23:21,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 [2024-11-19 14:23:21,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,483 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2024-11-19 14:23:21,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,506 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2024-11-19 14:23:21,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,530 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2024-11-19 14:23:21,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-11-19 14:23:21,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,557 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2024-11-19 14:23:21,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,569 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-19 14:23:21,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,581 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2024-11-19 14:23:21,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,592 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-11-19 14:23:21,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,604 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2024-11-19 14:23:21,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,627 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2024-11-19 14:23:21,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,650 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2024-11-19 14:23:21,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-19 14:23:21,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,673 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2024-11-19 14:23:21,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:21,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:21,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-19 14:23:21,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,699 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-19 14:23:21,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2024-11-19 14:23:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,723 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-19 14:23:21,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-11-19 14:23:21,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,749 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-19 14:23:21,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-19 14:23:21,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,772 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-19 14:23:21,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-19 14:23:21,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,795 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-19 14:23:21,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-11-19 14:23:21,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,819 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2024-11-19 14:23:21,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-19 14:23:21,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,842 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2024-11-19 14:23:21,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2024-11-19 14:23:21,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,866 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2024-11-19 14:23:21,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-11-19 14:23:21,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,890 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2024-11-19 14:23:21,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:21,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,913 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2024-11-19 14:23:21,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 [2024-11-19 14:23:21,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:21,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:21,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:21,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-11-19 14:23:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,936 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2024-11-19 14:23:21,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:21,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:21,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:21,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-11-19 14:23:21,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:21,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:21,961 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:21,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2024-11-19 14:23:21,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:21,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:21,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:21,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:21,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:21,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:21,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:21,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:22,006 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-11-19 14:23:22,006 INFO L444 ModelExtractionUtils]: 2 out of 28 variables were initially zero. Simplification set additionally 23 variables to zero. [2024-11-19 14:23:22,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:22,007 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:22,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2024-11-19 14:23:22,008 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:22,018 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:23:22,018 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:22,018 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~i~0#1 + 1*merge_sort_merge_~n#1 Supporting invariants [] [2024-11-19 14:23:22,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-11-19 14:23:22,051 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2024-11-19 14:23:22,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:22,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 14:23:22,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:22,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:22,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:23:22,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:22,209 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 [2024-11-19 14:23:22,209 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 504 states and 622 transitions. cyclomatic complexity: 141 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-19 14:23:22,259 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 504 states and 622 transitions. cyclomatic complexity: 141. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 825 states and 1039 transitions. Complement of second has 10 states. [2024-11-19 14:23:22,260 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 [2024-11-19 14:23:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-19 14:23:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-19 14:23:22,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 37 letters. Loop has 2 letters. [2024-11-19 14:23:22,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:22,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 39 letters. Loop has 2 letters. [2024-11-19 14:23:22,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:22,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 37 letters. Loop has 4 letters. [2024-11-19 14:23:22,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:22,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1039 transitions. [2024-11-19 14:23:22,266 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 244 [2024-11-19 14:23:22,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 764 states and 963 transitions. [2024-11-19 14:23:22,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2024-11-19 14:23:22,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 545 [2024-11-19 14:23:22,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 764 states and 963 transitions. [2024-11-19 14:23:22,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:22,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 764 states and 963 transitions. [2024-11-19 14:23:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states and 963 transitions. [2024-11-19 14:23:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 675. [2024-11-19 14:23:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 611 states have (on average 1.2225859247135842) internal successors, (747), 612 states have internal predecessors, (747), 42 states have call successors, (46), 27 states have call predecessors, (46), 22 states have return successors, (55), 35 states have call predecessors, (55), 39 states have call successors, (55) [2024-11-19 14:23:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 848 transitions. [2024-11-19 14:23:22,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 675 states and 848 transitions. [2024-11-19 14:23:22,281 INFO L425 stractBuchiCegarLoop]: Abstraction has 675 states and 848 transitions. [2024-11-19 14:23:22,281 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-19 14:23:22,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 675 states and 848 transitions. [2024-11-19 14:23:22,284 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 244 [2024-11-19 14:23:22,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:22,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:22,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:22,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:22,285 INFO L745 eck$LassoCheckResult]: Stem: 7692#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7625#L-1 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; 7626#L35 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; 7635#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 7636#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7637#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 7638#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7731#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 7732#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7698#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 7699#L40-4 havoc main_~i~1#1; 7599#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 7600#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7891#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 7889#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7890#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7893#L24 assume ~n#1 < 2; 7892#merge_sortFINAL assume true; 7888#merge_sortEXIT >#88#return; 7824#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 7833#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7988#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 7984#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7883#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7989#L24 assume ~n#1 < 2; 7987#merge_sortFINAL assume true; 7983#merge_sortEXIT >#88#return; 7980#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 7981#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7986#L24 assume ~n#1 < 2; 7982#merge_sortFINAL assume true; 7979#merge_sortEXIT >#90#return; 7978#L28 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; 7977#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 7976#L12 assume !(merge_~j~0#1 == merge_~n#1); 7975#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 7972#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 7969#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 7967#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 7965#L12-2 call write~int#0(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; 7963#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 7961#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 7960#L12 [2024-11-19 14:23:22,285 INFO L747 eck$LassoCheckResult]: Loop: 7960#L12 assume !(merge_~j~0#1 == merge_~n#1); 7974#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 7970#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 7971#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 7994#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 7924#L12-2 call write~int#0(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; 7925#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 7959#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 7960#L12 [2024-11-19 14:23:22,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:22,285 INFO L85 PathProgramCache]: Analyzing trace with hash 142503383, now seen corresponding path program 1 times [2024-11-19 14:23:22,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:22,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701902591] [2024-11-19 14:23:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:22,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:22,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:22,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2024-11-19 14:23:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605261088] [2024-11-19 14:23:22,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:22,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:22,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:22,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:22,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash -857173109, now seen corresponding path program 2 times [2024-11-19 14:23:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:22,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266117418] [2024-11-19 14:23:22,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:22,340 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:22,340 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 14:23:22,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:22,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266117418] [2024-11-19 14:23:22,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266117418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:22,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697038985] [2024-11-19 14:23:22,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:22,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:22,615 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:22,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2024-11-19 14:23:22,701 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:22,701 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:22,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:23:22,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 14:23:22,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 14:23:22,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697038985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:23:22,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 14:23:22,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2024-11-19 14:23:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929657762] [2024-11-19 14:23:22,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:23:22,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 14:23:22,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-19 14:23:22,975 INFO L87 Difference]: Start difference. First operand 675 states and 848 transitions. cyclomatic complexity: 207 Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 14:23:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:23,064 INFO L93 Difference]: Finished difference Result 894 states and 1085 transitions. [2024-11-19 14:23:23,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 894 states and 1085 transitions. [2024-11-19 14:23:23,072 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 126 [2024-11-19 14:23:23,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 894 states to 894 states and 1085 transitions. [2024-11-19 14:23:23,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 682 [2024-11-19 14:23:23,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 682 [2024-11-19 14:23:23,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 894 states and 1085 transitions. [2024-11-19 14:23:23,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:23,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 894 states and 1085 transitions. [2024-11-19 14:23:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states and 1085 transitions. [2024-11-19 14:23:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 779. [2024-11-19 14:23:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 705 states have (on average 1.1929078014184398) internal successors, (841), 704 states have internal predecessors, (841), 48 states have call successors, (52), 27 states have call predecessors, (52), 26 states have return successors, (76), 47 states have call predecessors, (76), 45 states have call successors, (76) [2024-11-19 14:23:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 969 transitions. [2024-11-19 14:23:23,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 779 states and 969 transitions. [2024-11-19 14:23:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 14:23:23,102 INFO L425 stractBuchiCegarLoop]: Abstraction has 779 states and 969 transitions. [2024-11-19 14:23:23,102 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-19 14:23:23,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 779 states and 969 transitions. [2024-11-19 14:23:23,105 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 126 [2024-11-19 14:23:23,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:23,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:23,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 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, 1, 1] [2024-11-19 14:23:23,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:23,109 INFO L745 eck$LassoCheckResult]: Stem: 9453#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9381#L-1 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; 9382#L35 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; 9388#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 9389#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9390#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 9391#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9501#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 9500#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9466#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 9467#L40-4 havoc main_~i~1#1; 9346#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 9347#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9613#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 9588#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 9589#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9610#L24 assume ~n#1 < 2; 9609#merge_sortFINAL assume true; 9587#merge_sortEXIT >#88#return; 9537#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9538#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9687#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 9682#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 9567#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9686#L24 assume ~n#1 < 2; 9685#merge_sortFINAL assume true; 9681#merge_sortEXIT >#88#return; 9683#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9734#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9736#L24 assume ~n#1 < 2; 9735#merge_sortFINAL assume true; 9733#merge_sortEXIT >#90#return; 9732#L28 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; 9731#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 9730#L12 assume !(merge_~j~0#1 == merge_~n#1); 9729#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 9727#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 9726#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 9725#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 9724#L12-2 call write~int#0(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; 9723#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9722#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 9720#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 9718#L12-2 call write~int#0(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; 9717#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9607#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 9606#L11-4 merge_~i~0#1 := 0; 9595#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 9592#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 9591#L8 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; 9586#merge_sortFINAL assume true; 9583#merge_sortEXIT >#90#return; 9533#L28 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; 9532#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 9531#L12 assume !(merge_~j~0#1 == merge_~n#1); 9530#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 9528#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 9525#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 9523#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 9521#L12-2 call write~int#0(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; 9519#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9517#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 9513#L12 [2024-11-19 14:23:23,110 INFO L747 eck$LassoCheckResult]: Loop: 9513#L12 assume !(merge_~j~0#1 == merge_~n#1); 9514#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 9526#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 9527#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 9515#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 9516#L12-2 call write~int#0(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; 9509#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9510#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 9513#L12 [2024-11-19 14:23:23,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1365976563, now seen corresponding path program 1 times [2024-11-19 14:23:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181496713] [2024-11-19 14:23:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-19 14:23:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181496713] [2024-11-19 14:23:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181496713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076102943] [2024-11-19 14:23:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:23,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:23,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:23,200 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:23,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2024-11-19 14:23:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:23,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 14:23:23,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 14:23:23,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 14:23:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076102943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:23,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:23,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 27 [2024-11-19 14:23:23,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301476198] [2024-11-19 14:23:23,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:23,687 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:23,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2024-11-19 14:23:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936102534] [2024-11-19 14:23:23,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:23,692 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:23,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:23,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:23,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:23,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:23,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 14:23:23,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-11-19 14:23:23,893 INFO L87 Difference]: Start difference. First operand 779 states and 969 transitions. cyclomatic complexity: 218 Second operand has 27 states, 25 states have (on average 3.84) internal successors, (96), 23 states have internal predecessors, (96), 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) [2024-11-19 14:23:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:24,527 INFO L93 Difference]: Finished difference Result 1224 states and 1507 transitions. [2024-11-19 14:23:24,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1224 states and 1507 transitions. [2024-11-19 14:23:24,536 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 268 [2024-11-19 14:23:24,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1224 states to 1224 states and 1507 transitions. [2024-11-19 14:23:24,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 980 [2024-11-19 14:23:24,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 980 [2024-11-19 14:23:24,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1224 states and 1507 transitions. [2024-11-19 14:23:24,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:24,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1224 states and 1507 transitions. [2024-11-19 14:23:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states and 1507 transitions. [2024-11-19 14:23:24,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 955. [2024-11-19 14:23:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 871 states have (on average 1.182548794489093) internal successors, (1030), 869 states have internal predecessors, (1030), 55 states have call successors, (60), 29 states have call predecessors, (60), 29 states have return successors, (86), 56 states have call predecessors, (86), 52 states have call successors, (86) [2024-11-19 14:23:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1176 transitions. [2024-11-19 14:23:24,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 955 states and 1176 transitions. [2024-11-19 14:23:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 14:23:24,567 INFO L425 stractBuchiCegarLoop]: Abstraction has 955 states and 1176 transitions. [2024-11-19 14:23:24,567 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-19 14:23:24,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 955 states and 1176 transitions. [2024-11-19 14:23:24,570 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 170 [2024-11-19 14:23:24,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:24,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:24,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:24,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:24,573 INFO L745 eck$LassoCheckResult]: Stem: 11900#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11818#L-1 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; 11819#L35 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; 11834#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 11835#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 11915#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 11918#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 11836#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 11837#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 11838#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 11909#L40-4 havoc main_~i~1#1; 11793#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 11794#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12212#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 12209#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12210#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12213#L24 assume ~n#1 < 2; 12211#merge_sortFINAL assume true; 12208#merge_sortEXIT >#88#return; 12055#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 12097#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12361#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 12354#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12297#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12359#L24 assume ~n#1 < 2; 12358#merge_sortFINAL assume true; 12353#merge_sortEXIT >#88#return; 12348#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 12351#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12357#L24 assume ~n#1 < 2; 12352#merge_sortFINAL assume true; 12347#merge_sortEXIT >#90#return; 12350#L28 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; 12409#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12408#L12 assume !(merge_~j~0#1 == merge_~n#1); 12407#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12405#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 12404#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 12403#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12402#L12-2 call write~int#0(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; 12401#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12400#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12397#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 12393#L12-2 call write~int#0(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; 12392#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12070#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 12059#L11-4 merge_~i~0#1 := 0; 12060#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 12054#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 12056#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 12224#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 12225#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 12216#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 12217#L8 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; 12158#merge_sortFINAL assume true; 12159#merge_sortEXIT >#90#return; 12091#L28 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; 12090#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12089#L12 assume !(merge_~j~0#1 == merge_~n#1); 12088#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12086#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 12085#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 12084#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12083#L12-2 call write~int#0(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; 12082#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12081#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12077#L12 [2024-11-19 14:23:24,573 INFO L747 eck$LassoCheckResult]: Loop: 12077#L12 assume !(merge_~j~0#1 == merge_~n#1); 12079#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12114#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 12115#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 12080#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12076#L12-2 call write~int#0(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; 12074#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12075#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 12077#L12 [2024-11-19 14:23:24,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash 875722351, now seen corresponding path program 1 times [2024-11-19 14:23:24,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:24,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934090878] [2024-11-19 14:23:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:24,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:24,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:24,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:24,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2024-11-19 14:23:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:24,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466227880] [2024-11-19 14:23:24,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:24,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:24,656 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:24,656 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:24,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:24,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:24,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash 817267747, now seen corresponding path program 2 times [2024-11-19 14:23:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:24,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759563013] [2024-11-19 14:23:24,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:24,704 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:24,704 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:24,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:24,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:28,892 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:28,892 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:28,892 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:28,892 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:28,893 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:28,893 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:28,893 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:28,893 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:28,893 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso [2024-11-19 14:23:28,893 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:28,893 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:28,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:28,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:28,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:28,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:28,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:29,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:30,794 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:30,794 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:30,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:30,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:30,795 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:30,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2024-11-19 14:23:30,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:30,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:30,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:30,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:30,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:30,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:30,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:30,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:30,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:30,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:30,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:30,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:30,820 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:30,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2024-11-19 14:23:30,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:30,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:30,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:30,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:30,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:30,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:30,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:30,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:30,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:30,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-11-19 14:23:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:30,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:30,845 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:30,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2024-11-19 14:23:30,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:30,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:30,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:30,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:30,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:30,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:30,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:30,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:30,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:30,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-11-19 14:23:30,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:30,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:30,868 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:30,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2024-11-19 14:23:30,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:30,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:30,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:30,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:30,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:30,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:30,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:30,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:30,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:30,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-11-19 14:23:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:30,891 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:30,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2024-11-19 14:23:30,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:30,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:30,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:30,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:30,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:30,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:30,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:30,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:30,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:30,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:30,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:30,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:30,915 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:30,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-11-19 14:23:30,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:30,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:30,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:30,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:30,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:30,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:30,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:30,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:30,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-11-19 14:23:30,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:30,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:30,941 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:30,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-19 14:23:30,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:30,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:30,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:30,953 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 14:23:30,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:30,976 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-19 14:23:30,976 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-19 14:23:31,042 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:31,300 INFO L443 ModelExtractionUtils]: Simplification made 38 calls to the SMT solver. [2024-11-19 14:23:31,300 INFO L444 ModelExtractionUtils]: 15 out of 76 variables were initially zero. Simplification set additionally 58 variables to zero. [2024-11-19 14:23:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:31,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:31,302 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:31,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-19 14:23:31,303 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:31,314 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2024-11-19 14:23:31,314 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:31,314 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~a#1.base)_3, merge_sort_merge_~j~0#1) = 1*v_rep(select #length merge_sort_merge_~a#1.base)_3 - 4*merge_sort_merge_~j~0#1 Supporting invariants [] [2024-11-19 14:23:31,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-11-19 14:23:31,454 INFO L156 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2024-11-19 14:23:31,455 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:23:31,456 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:23:31,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:31,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 14:23:31,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:31,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:23:31,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:31,926 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2024-11-19 14:23:31,926 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 955 states and 1176 transitions. cyclomatic complexity: 255 Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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) [2024-11-19 14:23:31,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:32,089 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 955 states and 1176 transitions. cyclomatic complexity: 255. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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 979 states and 1215 transitions. Complement of second has 12 states. [2024-11-19 14:23:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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) [2024-11-19 14:23:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2024-11-19 14:23:32,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 66 letters. Loop has 8 letters. [2024-11-19 14:23:32,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:32,091 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:23:32,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:32,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 14:23:32,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:32,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:23:32,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:32,572 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 3 loop predicates [2024-11-19 14:23:32,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 955 states and 1176 transitions. cyclomatic complexity: 255 Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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) [2024-11-19 14:23:32,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 955 states and 1176 transitions. cyclomatic complexity: 255. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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 979 states and 1215 transitions. Complement of second has 12 states. [2024-11-19 14:23:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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) [2024-11-19 14:23:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2024-11-19 14:23:32,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 66 letters. Loop has 8 letters. [2024-11-19 14:23:32,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:32,715 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:23:32,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:32,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 14:23:32,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:33,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:23:33,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:33,169 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 [2024-11-19 14:23:33,170 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 955 states and 1176 transitions. cyclomatic complexity: 255 Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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) [2024-11-19 14:23:33,466 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 955 states and 1176 transitions. cyclomatic complexity: 255. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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 1327 states and 1642 transitions. Complement of second has 56 states. [2024-11-19 14:23:33,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:23:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 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) [2024-11-19 14:23:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2024-11-19 14:23:33,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 119 transitions. Stem has 66 letters. Loop has 8 letters. [2024-11-19 14:23:33,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:33,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 119 transitions. Stem has 74 letters. Loop has 8 letters. [2024-11-19 14:23:33,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:33,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 119 transitions. Stem has 66 letters. Loop has 16 letters. [2024-11-19 14:23:33,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:33,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1327 states and 1642 transitions. [2024-11-19 14:23:33,477 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 209 [2024-11-19 14:23:33,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1327 states to 1275 states and 1574 transitions. [2024-11-19 14:23:33,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 883 [2024-11-19 14:23:33,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 996 [2024-11-19 14:23:33,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1275 states and 1574 transitions. [2024-11-19 14:23:33,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:33,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1275 states and 1574 transitions. [2024-11-19 14:23:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states and 1574 transitions. [2024-11-19 14:23:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1171. [2024-11-19 14:23:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1075 states have (on average 1.1906976744186046) internal successors, (1280), 1071 states have internal predecessors, (1280), 64 states have call successors, (70), 31 states have call predecessors, (70), 32 states have return successors, (102), 68 states have call predecessors, (102), 61 states have call successors, (102) [2024-11-19 14:23:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1452 transitions. [2024-11-19 14:23:33,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1171 states and 1452 transitions. [2024-11-19 14:23:33,537 INFO L425 stractBuchiCegarLoop]: Abstraction has 1171 states and 1452 transitions. [2024-11-19 14:23:33,537 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-19 14:23:33,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1171 states and 1452 transitions. [2024-11-19 14:23:33,542 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 198 [2024-11-19 14:23:33,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:33,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:33,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:33,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:23:33,543 INFO L745 eck$LassoCheckResult]: Stem: 17084#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17017#L-1 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; 17018#L35 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; 17026#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 17027#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17100#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 17102#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17028#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 17029#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17236#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 17235#L40-4 havoc main_~i~1#1; 16982#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 16983#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17392#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 17389#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 17390#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17393#L24 assume ~n#1 < 2; 17391#merge_sortFINAL assume true; 17388#merge_sortEXIT >#88#return; 17276#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 17277#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17723#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 17717#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 17610#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17721#L24 assume ~n#1 < 2; 17720#merge_sortFINAL assume true; 17715#merge_sortEXIT >#88#return; 17711#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 17713#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17719#L24 assume ~n#1 < 2; 17714#merge_sortFINAL assume true; 17709#merge_sortEXIT >#90#return; 17712#L28 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; 17780#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17779#L12 assume !(merge_~j~0#1 == merge_~n#1); 17778#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 17775#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 17773#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 17771#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 17769#L12-2 call write~int#0(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; 17767#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17763#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17760#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 17430#L12-2 call write~int#0(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; 17431#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17426#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 17427#L11-4 merge_~i~0#1 := 0; 17422#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 17423#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 17410#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 17403#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 17401#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 17402#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 17394#L8 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; 17395#merge_sortFINAL assume true; 17358#merge_sortEXIT >#90#return; 17274#L28 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; 17269#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17270#L12 assume !(merge_~j~0#1 == merge_~n#1); 17265#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 17266#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 17810#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 17825#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 17824#L12-2 call write~int#0(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; 17823#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17822#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17819#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 17820#L12-2 [2024-11-19 14:23:33,543 INFO L747 eck$LassoCheckResult]: Loop: 17820#L12-2 call write~int#0(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; 17878#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17879#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 17880#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 17820#L12-2 [2024-11-19 14:23:33,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1377589123, now seen corresponding path program 3 times [2024-11-19 14:23:33,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:33,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848956988] [2024-11-19 14:23:33,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:33,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:33,587 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:23:33,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:33,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:33,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848956988] [2024-11-19 14:23:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848956988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:33,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312019041] [2024-11-19 14:23:33,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:33,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:33,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:33,904 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:33,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2024-11-19 14:23:34,024 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:23:34,024 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:34,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:23:34,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:34,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312019041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:34,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 19 [2024-11-19 14:23:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609516669] [2024-11-19 14:23:34,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:34,240 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:34,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:34,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 2 times [2024-11-19 14:23:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:34,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097465047] [2024-11-19 14:23:34,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:34,244 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:34,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:34,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:34,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 14:23:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-19 14:23:34,359 INFO L87 Difference]: Start difference. First operand 1171 states and 1452 transitions. cyclomatic complexity: 325 Second operand has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 14:23:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:34,636 INFO L93 Difference]: Finished difference Result 1226 states and 1514 transitions. [2024-11-19 14:23:34,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1226 states and 1514 transitions. [2024-11-19 14:23:34,645 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 218 [2024-11-19 14:23:34,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1226 states to 1226 states and 1514 transitions. [2024-11-19 14:23:34,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 941 [2024-11-19 14:23:34,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 941 [2024-11-19 14:23:34,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1226 states and 1514 transitions. [2024-11-19 14:23:34,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:34,652 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1226 states and 1514 transitions. [2024-11-19 14:23:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states and 1514 transitions. [2024-11-19 14:23:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1186. [2024-11-19 14:23:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1090 states have (on average 1.189908256880734) internal successors, (1297), 1086 states have internal predecessors, (1297), 64 states have call successors, (70), 31 states have call predecessors, (70), 32 states have return successors, (102), 68 states have call predecessors, (102), 61 states have call successors, (102) [2024-11-19 14:23:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1469 transitions. [2024-11-19 14:23:34,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1186 states and 1469 transitions. [2024-11-19 14:23:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 14:23:34,674 INFO L425 stractBuchiCegarLoop]: Abstraction has 1186 states and 1469 transitions. [2024-11-19 14:23:34,675 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-19 14:23:34,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1186 states and 1469 transitions. [2024-11-19 14:23:34,679 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 198 [2024-11-19 14:23:34,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:34,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:34,681 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:34,681 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:34,681 INFO L745 eck$LassoCheckResult]: Stem: 19909#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 19837#L-1 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; 19838#L35 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; 19857#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 19858#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 19926#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 19929#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 19859#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 19860#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 19920#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 19921#L40-4 havoc main_~i~1#1; 19813#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 19814#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20290#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 20286#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 20288#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20291#L24 assume ~n#1 < 2; 20289#merge_sortFINAL assume true; 20285#merge_sortEXIT >#88#return; 20287#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 20512#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20510#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 20500#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 20504#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20513#L24 assume ~n#1 < 2; 20506#merge_sortFINAL assume true; 20499#merge_sortEXIT >#88#return; 20494#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 20497#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20505#L24 assume ~n#1 < 2; 20498#merge_sortFINAL assume true; 20492#merge_sortEXIT >#90#return; 20496#L28 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; 20575#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20572#L12 assume !(merge_~j~0#1 == merge_~n#1); 20569#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 20565#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 20562#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 20560#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 20558#L12-2 call write~int#0(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; 20556#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 20550#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20545#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 20542#L12-2 call write~int#0(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; 20537#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 20533#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 20531#L11-4 merge_~i~0#1 := 0; 20526#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 20525#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 20524#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 20440#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 20441#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 20521#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 20520#L8 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; 20519#merge_sortFINAL assume true; 20517#merge_sortEXIT >#90#return; 20089#L28 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; 20090#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20085#L12 assume !(merge_~j~0#1 == merge_~n#1); 20086#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 20081#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 20079#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 20080#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 20075#L12-2 call write~int#0(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; 20076#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 20072#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20071#L12 assume !(merge_~j~0#1 == merge_~n#1); 19833#L13 [2024-11-19 14:23:34,681 INFO L747 eck$LassoCheckResult]: Loop: 19833#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19834#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 19815#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 19818#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19910#L12-2 call write~int#0(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; 19902#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19903#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 19863#L12 assume !(merge_~j~0#1 == merge_~n#1); 19833#L13 [2024-11-19 14:23:34,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1377589125, now seen corresponding path program 4 times [2024-11-19 14:23:34,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:34,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104539797] [2024-11-19 14:23:34,682 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:34,725 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:34,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:34,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:34,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:34,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash 617079631, now seen corresponding path program 3 times [2024-11-19 14:23:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:34,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825517113] [2024-11-19 14:23:34,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:34,776 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:34,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:34,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:34,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:34,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1340503763, now seen corresponding path program 1 times [2024-11-19 14:23:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:34,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541193176] [2024-11-19 14:23:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:34,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:34,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:40,142 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:23:40,142 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:23:40,142 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:23:40,142 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:23:40,142 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:23:40,142 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:40,142 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:23:40,142 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:23:40,142 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration19_Lasso [2024-11-19 14:23:40,142 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:23:40,142 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:23:40,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,167 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:40,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:41,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:23:41,817 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:23:41,817 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:23:41,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:41,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:41,819 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:41,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-19 14:23:41,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:41,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:41,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:41,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:41,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:41,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:41,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:41,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:41,831 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:41,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-19 14:23:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:41,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:41,842 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:41,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-19 14:23:41,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 [2024-11-19 14:23:41,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:41,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:41,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:41,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:41,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:41,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:41,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:41,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:41,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-19 14:23:41,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:41,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:41,878 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:41,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-19 14:23:41,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:41,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:41,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:41,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:41,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:41,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:41,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:41,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:41,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:41,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:41,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:41,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:41,902 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:41,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2024-11-19 14:23:41,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:41,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:41,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:41,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:41,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:41,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:41,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:41,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:41,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:41,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2024-11-19 14:23:41,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:41,925 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:41,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2024-11-19 14:23:41,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:41,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:41,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:41,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:41,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:41,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:41,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:41,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:41,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:41,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-11-19 14:23:41,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:41,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:41,949 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:41,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-11-19 14:23:41,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:41,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:41,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:41,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:41,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:41,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:41,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:41,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:41,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:41,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2024-11-19 14:23:41,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:41,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:41,972 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:41,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-11-19 14:23:41,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:41,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:41,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:41,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:41,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:41,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:41,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:41,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:41,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:41,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:41,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:41,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:41,998 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:41,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2024-11-19 14:23:41,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2024-11-19 14:23:42,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,021 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2024-11-19 14:23:42,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2024-11-19 14:23:42,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,045 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2024-11-19 14:23:42,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2024-11-19 14:23:42,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,074 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2024-11-19 14:23:42,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2024-11-19 14:23:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,097 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2024-11-19 14:23:42,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2024-11-19 14:23:42,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,123 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2024-11-19 14:23:42,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2024-11-19 14:23:42,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,146 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2024-11-19 14:23:42,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2024-11-19 14:23:42,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,170 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2024-11-19 14:23:42,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2024-11-19 14:23:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,193 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2024-11-19 14:23:42,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2024-11-19 14:23:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,234 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2024-11-19 14:23:42,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2024-11-19 14:23:42,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,259 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2024-11-19 14:23:42,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 [2024-11-19 14:23:42,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,272 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2024-11-19 14:23:42,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,283 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2024-11-19 14:23:42,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,307 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2024-11-19 14:23:42,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 [2024-11-19 14:23:42,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-11-19 14:23:42,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,331 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2024-11-19 14:23:42,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2024-11-19 14:23:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,355 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2024-11-19 14:23:42,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 [2024-11-19 14:23:42,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-11-19 14:23:42,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,379 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2024-11-19 14:23:42,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2024-11-19 14:23:42,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,403 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2024-11-19 14:23:42,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2024-11-19 14:23:42,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,426 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2024-11-19 14:23:42,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2024-11-19 14:23:42,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,450 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2024-11-19 14:23:42,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2024-11-19 14:23:42,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,473 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2024-11-19 14:23:42,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2024-11-19 14:23:42,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,497 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2024-11-19 14:23:42,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2024-11-19 14:23:42,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,520 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2024-11-19 14:23:42,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2024-11-19 14:23:42,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,544 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2024-11-19 14:23:42,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:23:42,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:23:42,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:23:42,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2024-11-19 14:23:42,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,569 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2024-11-19 14:23:42,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:42,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:42,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2024-11-19 14:23:42,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,621 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2024-11-19 14:23:42,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:42,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:42,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2024-11-19 14:23:42,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,646 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2024-11-19 14:23:42,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:23:42,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:23:42,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:23:42,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:23:42,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2024-11-19 14:23:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:42,673 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:42,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2024-11-19 14:23:42,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:23:42,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:23:42,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:23:42,686 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-19 14:23:42,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:23:42,735 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-11-19 14:23:42,735 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-19 14:23:42,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:23:44,689 INFO L443 ModelExtractionUtils]: Simplification made 100 calls to the SMT solver. [2024-11-19 14:23:44,689 INFO L444 ModelExtractionUtils]: 4 out of 109 variables were initially zero. Simplification set additionally 102 variables to zero. [2024-11-19 14:23:44,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:23:44,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:44,690 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:23:44,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2024-11-19 14:23:44,692 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:23:44,705 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2024-11-19 14:23:44,705 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:23:44,705 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~a#1.base)_4, merge_sort_merge_~i~0#1) = 5*v_rep(select #length merge_sort_merge_~a#1.base)_4 - 8*merge_sort_merge_~i~0#1 Supporting invariants [] [2024-11-19 14:23:44,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2024-11-19 14:23:44,787 INFO L156 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2024-11-19 14:23:44,790 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:23:44,790 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:23:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:44,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 14:23:44,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:45,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:23:45,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:45,403 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.15 stem predicates 3 loop predicates [2024-11-19 14:23:45,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1186 states and 1469 transitions. cyclomatic complexity: 328 Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:23:45,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1186 states and 1469 transitions. cyclomatic complexity: 328. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1202 states and 1493 transitions. Complement of second has 22 states. [2024-11-19 14:23:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 14 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:23:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2024-11-19 14:23:45,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 67 letters. Loop has 8 letters. [2024-11-19 14:23:45,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:45,718 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:23:45,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:45,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-19 14:23:45,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:46,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2024-11-19 14:23:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:46,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:23:46,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:46,748 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.22 stem predicates 3 loop predicates [2024-11-19 14:23:46,749 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1186 states and 1469 transitions. cyclomatic complexity: 328 Second operand has 25 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 14:23:47,353 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1186 states and 1469 transitions. cyclomatic complexity: 328. Second operand has 25 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 1210 states and 1499 transitions. Complement of second has 30 states. [2024-11-19 14:23:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 19 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:23:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 14:23:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 43 transitions. [2024-11-19 14:23:47,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 43 transitions. Stem has 67 letters. Loop has 8 letters. [2024-11-19 14:23:47,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:47,357 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:23:47,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:47,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-19 14:23:47,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:48,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:23:48,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:23:48,168 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.17 stem predicates 3 loop predicates [2024-11-19 14:23:48,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1186 states and 1469 transitions. cyclomatic complexity: 328 Second operand has 20 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 14:23:49,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1186 states and 1469 transitions. cyclomatic complexity: 328. Second operand has 20 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Result 3156 states and 3948 transitions. Complement of second has 65 states. [2024-11-19 14:23:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 21 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-19 14:23:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 3.176470588235294) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 14:23:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 155 transitions. [2024-11-19 14:23:49,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 155 transitions. Stem has 67 letters. Loop has 8 letters. [2024-11-19 14:23:49,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:49,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 155 transitions. Stem has 75 letters. Loop has 8 letters. [2024-11-19 14:23:49,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:49,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 155 transitions. Stem has 67 letters. Loop has 16 letters. [2024-11-19 14:23:49,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:23:49,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3156 states and 3948 transitions. [2024-11-19 14:23:49,062 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 670 [2024-11-19 14:23:49,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3156 states to 3150 states and 3941 transitions. [2024-11-19 14:23:49,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2101 [2024-11-19 14:23:49,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2269 [2024-11-19 14:23:49,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3150 states and 3941 transitions. [2024-11-19 14:23:49,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:49,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3150 states and 3941 transitions. [2024-11-19 14:23:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states and 3941 transitions. [2024-11-19 14:23:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2444. [2024-11-19 14:23:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2253 states have (on average 1.1939636040834443) internal successors, (2690), 2247 states have internal predecessors, (2690), 125 states have call successors, (135), 55 states have call predecessors, (135), 66 states have return successors, (215), 141 states have call predecessors, (215), 122 states have call successors, (215) [2024-11-19 14:23:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3040 transitions. [2024-11-19 14:23:49,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2444 states and 3040 transitions. [2024-11-19 14:23:49,130 INFO L425 stractBuchiCegarLoop]: Abstraction has 2444 states and 3040 transitions. [2024-11-19 14:23:49,130 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-19 14:23:49,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2444 states and 3040 transitions. [2024-11-19 14:23:49,139 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 452 [2024-11-19 14:23:49,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:49,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:49,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:49,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:23:49,140 INFO L745 eck$LassoCheckResult]: Stem: 27731#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 27652#L-1 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; 27653#L35 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; 27661#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 27662#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 27736#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 27737#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 27663#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 27664#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 27733#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 27735#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 27760#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 27759#L40-4 havoc main_~i~1#1; 27640#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 27758#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27757#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 27748#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 27753#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27761#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 27742#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 27750#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27754#L24 assume ~n#1 < 2; 27755#merge_sortFINAL assume true; 27746#merge_sortEXIT >#88#return; 27747#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 27745#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28253#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 27773#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28243#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28251#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 28252#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28653#$Ultimate##0 [2024-11-19 14:23:49,140 INFO L747 eck$LassoCheckResult]: Loop: 28653#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28656#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 28651#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28653#$Ultimate##0 [2024-11-19 14:23:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1652352750, now seen corresponding path program 4 times [2024-11-19 14:23:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258635354] [2024-11-19 14:23:49,141 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:49,151 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:49,151 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 14:23:49,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:49,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258635354] [2024-11-19 14:23:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258635354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:49,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536160328] [2024-11-19 14:23:49,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:49,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:49,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:49,335 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:49,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2024-11-19 14:23:49,428 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:49,428 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:49,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:23:49,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 14:23:49,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 14:23:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536160328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:49,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:49,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-11-19 14:23:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395229417] [2024-11-19 14:23:49,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:49,573 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 5 times [2024-11-19 14:23:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:49,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044218071] [2024-11-19 14:23:49,574 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:49,577 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:49,577 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:49,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:49,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:49,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:49,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 14:23:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-19 14:23:49,670 INFO L87 Difference]: Start difference. First operand 2444 states and 3040 transitions. cyclomatic complexity: 678 Second operand has 18 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 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) [2024-11-19 14:23:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:49,861 INFO L93 Difference]: Finished difference Result 1530 states and 1889 transitions. [2024-11-19 14:23:49,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1530 states and 1889 transitions. [2024-11-19 14:23:49,866 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 342 [2024-11-19 14:23:49,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1530 states to 1515 states and 1872 transitions. [2024-11-19 14:23:49,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1248 [2024-11-19 14:23:49,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1254 [2024-11-19 14:23:49,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1515 states and 1872 transitions. [2024-11-19 14:23:49,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:49,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1515 states and 1872 transitions. [2024-11-19 14:23:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states and 1872 transitions. [2024-11-19 14:23:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1207. [2024-11-19 14:23:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1127 states have (on average 1.2023070097604258) internal successors, (1355), 1126 states have internal predecessors, (1355), 46 states have call successors, (48), 29 states have call predecessors, (48), 34 states have return successors, (88), 51 states have call predecessors, (88), 43 states have call successors, (88) [2024-11-19 14:23:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1491 transitions. [2024-11-19 14:23:49,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1207 states and 1491 transitions. [2024-11-19 14:23:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 14:23:49,889 INFO L425 stractBuchiCegarLoop]: Abstraction has 1207 states and 1491 transitions. [2024-11-19 14:23:49,889 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-19 14:23:49,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1207 states and 1491 transitions. [2024-11-19 14:23:49,892 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 254 [2024-11-19 14:23:49,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:49,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:49,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2024-11-19 14:23:49,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:49,893 INFO L745 eck$LassoCheckResult]: Stem: 31898#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 31839#L-1 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; 31840#L35 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; 31842#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 31843#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31844#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 31845#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31904#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 31908#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31907#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 31906#L40-4 havoc main_~i~1#1; 31822#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 31823#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32015#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 32009#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 32012#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32016#L24 assume ~n#1 < 2; 32013#merge_sortFINAL assume true; 32008#merge_sortEXIT >#88#return; 31878#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 32007#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32006#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 31998#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31999#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32084#L24 assume ~n#1 < 2; 32083#merge_sortFINAL assume true; 31997#merge_sortEXIT >#88#return; 31993#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 31994#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31996#L24 assume ~n#1 < 2; 31995#merge_sortFINAL assume true; 31992#merge_sortEXIT >#90#return; 31991#L28 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; 31945#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31944#L12 assume !(merge_~j~0#1 == merge_~n#1); 31943#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31940#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 31938#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 31936#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31934#L12-2 call write~int#0(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; 31931#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31923#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31919#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 31920#L12-2 call write~int#0(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; 31915#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31916#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 31911#L11-4 merge_~i~0#1 := 0; 31912#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 31877#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 31879#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 32059#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 32058#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 32057#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 32056#L8 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; 32055#merge_sortFINAL assume true; 32052#merge_sortEXIT >#90#return; 32051#L28 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; 32050#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 32049#L12 assume !(merge_~j~0#1 == merge_~n#1); 32048#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 32046#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 32044#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 32042#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 32040#L12-2 call write~int#0(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; 32038#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 32036#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 32033#L12 assume !(merge_~j~0#1 == merge_~n#1); 32034#L13 [2024-11-19 14:23:49,893 INFO L747 eck$LassoCheckResult]: Loop: 32034#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 32800#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 32790#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 32756#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 32754#L12-2 call write~int#0(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; 32755#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 32819#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 32801#L12 assume !(merge_~j~0#1 == merge_~n#1); 32034#L13 [2024-11-19 14:23:49,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1142370809, now seen corresponding path program 2 times [2024-11-19 14:23:49,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:49,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053942131] [2024-11-19 14:23:49,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:49,922 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:49,922 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:49,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:49,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:49,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash 617079631, now seen corresponding path program 4 times [2024-11-19 14:23:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:49,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597636703] [2024-11-19 14:23:49,969 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:49,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:49,973 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:49,973 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:49,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:49,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 60640085, now seen corresponding path program 3 times [2024-11-19 14:23:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:49,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572930610] [2024-11-19 14:23:49,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:50,003 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:23:50,004 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 34 proven. 29 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572930610] [2024-11-19 14:23:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572930610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047873518] [2024-11-19 14:23:50,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:50,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:50,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:50,604 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:50,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2024-11-19 14:23:50,775 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:23:50,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:50,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:23:50,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 41 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:51,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 44 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047873518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:51,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:51,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 38 [2024-11-19 14:23:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092690939] [2024-11-19 14:23:51,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 14:23:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 14:23:51,673 INFO L87 Difference]: Start difference. First operand 1207 states and 1491 transitions. cyclomatic complexity: 334 Second operand has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 35 states have internal predecessors, (105), 7 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 14:23:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:52,746 INFO L93 Difference]: Finished difference Result 1567 states and 1903 transitions. [2024-11-19 14:23:52,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1567 states and 1903 transitions. [2024-11-19 14:23:52,756 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 308 [2024-11-19 14:23:52,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1567 states to 1542 states and 1876 transitions. [2024-11-19 14:23:52,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1254 [2024-11-19 14:23:52,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1256 [2024-11-19 14:23:52,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1542 states and 1876 transitions. [2024-11-19 14:23:52,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:52,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1542 states and 1876 transitions. [2024-11-19 14:23:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states and 1876 transitions. [2024-11-19 14:23:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1377. [2024-11-19 14:23:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1291 states have (on average 1.2044926413632844) internal successors, (1555), 1289 states have internal predecessors, (1555), 49 states have call successors, (51), 32 states have call predecessors, (51), 37 states have return successors, (91), 55 states have call predecessors, (91), 46 states have call successors, (91) [2024-11-19 14:23:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1697 transitions. [2024-11-19 14:23:52,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1377 states and 1697 transitions. [2024-11-19 14:23:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 14:23:52,791 INFO L425 stractBuchiCegarLoop]: Abstraction has 1377 states and 1697 transitions. [2024-11-19 14:23:52,791 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-19 14:23:52,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1377 states and 1697 transitions. [2024-11-19 14:23:52,796 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 294 [2024-11-19 14:23:52,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:52,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:52,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 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, 1, 1, 1, 1] [2024-11-19 14:23:52,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:52,797 INFO L745 eck$LassoCheckResult]: Stem: 35198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35145#L-1 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; 35146#L35 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; 35148#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 35149#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35150#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 35151#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35205#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 35208#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35207#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 35152#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 35153#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 35441#L40-4 havoc main_~i~1#1; 35157#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 35440#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35266#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35168#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35169#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35177#L24 assume ~n#1 < 2; 35282#merge_sortFINAL assume true; 35279#merge_sortEXIT >#88#return; 35223#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35435#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35434#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 35432#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35433#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35443#L24 assume ~n#1 < 2; 35437#merge_sortFINAL assume true; 35431#merge_sortEXIT >#88#return; 35286#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35429#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35430#L24 assume ~n#1 < 2; 35428#merge_sortFINAL assume true; 35285#merge_sortEXIT >#90#return; 35287#L28 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; 35240#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35241#L12 assume !(merge_~j~0#1 == merge_~n#1); 35236#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35237#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 35231#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 35232#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35227#L12-2 call write~int#0(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; 35228#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35222#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35224#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 35400#L12-2 call write~int#0(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; 35401#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35397#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 35396#L11-4 merge_~i~0#1 := 0; 35395#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 35394#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35393#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 35392#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35391#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 35390#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35389#L8 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; 35387#merge_sortFINAL assume true; 35388#merge_sortEXIT >#90#return; 35378#L28 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; 35376#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35374#L12 assume !(merge_~j~0#1 == merge_~n#1); 35370#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35367#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 35368#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 35382#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35379#L12-2 call write~int#0(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; 35377#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35375#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35372#L12 assume !(merge_~j~0#1 == merge_~n#1); 35373#L13 [2024-11-19 14:23:52,798 INFO L747 eck$LassoCheckResult]: Loop: 35373#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35170#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 35171#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 36473#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 36508#L12-2 call write~int#0(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; 36505#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 36506#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 36415#L12 assume !(merge_~j~0#1 == merge_~n#1); 35373#L13 [2024-11-19 14:23:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash 977989481, now seen corresponding path program 4 times [2024-11-19 14:23:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81326774] [2024-11-19 14:23:52,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:52,824 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:52,825 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 14:23:52,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:52,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81326774] [2024-11-19 14:23:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81326774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:53,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743936706] [2024-11-19 14:23:53,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:53,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:53,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:53,002 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:53,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2024-11-19 14:23:53,184 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:53,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:53,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:23:53,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 23 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 14:23:53,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 14:23:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743936706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:53,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:53,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 20 [2024-11-19 14:23:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664826960] [2024-11-19 14:23:53,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:53,527 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:53,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:53,527 INFO L85 PathProgramCache]: Analyzing trace with hash 617079631, now seen corresponding path program 5 times [2024-11-19 14:23:53,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:53,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853585950] [2024-11-19 14:23:53,528 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:53,532 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:53,533 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:53,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:53,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:53,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:53,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 14:23:53,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-19 14:23:53,672 INFO L87 Difference]: Start difference. First operand 1377 states and 1697 transitions. cyclomatic complexity: 372 Second operand has 20 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 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) [2024-11-19 14:23:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:53,876 INFO L93 Difference]: Finished difference Result 1387 states and 1721 transitions. [2024-11-19 14:23:53,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1387 states and 1721 transitions. [2024-11-19 14:23:53,881 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 364 [2024-11-19 14:23:53,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1387 states to 1384 states and 1718 transitions. [2024-11-19 14:23:53,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1162 [2024-11-19 14:23:53,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1162 [2024-11-19 14:23:53,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1384 states and 1718 transitions. [2024-11-19 14:23:53,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:53,887 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1384 states and 1718 transitions. [2024-11-19 14:23:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states and 1718 transitions. [2024-11-19 14:23:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1225. [2024-11-19 14:23:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1150 states have (on average 1.2104347826086956) internal successors, (1392), 1148 states have internal predecessors, (1392), 43 states have call successors, (45), 28 states have call predecessors, (45), 32 states have return successors, (83), 48 states have call predecessors, (83), 40 states have call successors, (83) [2024-11-19 14:23:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1520 transitions. [2024-11-19 14:23:53,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1225 states and 1520 transitions. [2024-11-19 14:23:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 14:23:53,902 INFO L425 stractBuchiCegarLoop]: Abstraction has 1225 states and 1520 transitions. [2024-11-19 14:23:53,903 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-19 14:23:53,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1520 transitions. [2024-11-19 14:23:53,906 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 294 [2024-11-19 14:23:53,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:53,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:53,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:53,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:23:53,907 INFO L745 eck$LassoCheckResult]: Stem: 38416#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 38357#L-1 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; 38358#L35 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; 38362#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 38363#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 38364#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 38365#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 38424#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 38428#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 38427#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 38366#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 38367#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 38420#L40-4 havoc main_~i~1#1; 38348#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 38425#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38529#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 38395#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 38386#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38396#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 38410#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 38522#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38524#L24 assume ~n#1 < 2; 38523#merge_sortFINAL assume true; 38521#merge_sortEXIT >#88#return; 38444#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 38513#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38530#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 38531#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 38546#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38547#L24 assume ~n#1 < 2; 38533#merge_sortFINAL assume true; 38534#merge_sortEXIT >#88#return; 38544#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 38549#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 38548#L24 assume ~n#1 < 2; 38543#merge_sortFINAL assume true; 38545#merge_sortEXIT >#90#return; 38509#L28 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; 38510#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38475#L12 assume !(merge_~j~0#1 == merge_~n#1); 38476#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 38466#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 38467#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 38458#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 38459#L12-2 call write~int#0(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; 38780#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 38492#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38493#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 38774#L12-2 call write~int#0(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; 38770#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 38767#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 38762#L11-4 merge_~i~0#1 := 0; 38760#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 38752#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 38751#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 38749#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 38747#L8 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; 38745#merge_sortFINAL assume true; 38743#merge_sortEXIT >#90#return; 38720#L28 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; 38719#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38718#L12 assume !(merge_~j~0#1 == merge_~n#1); 38717#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 38715#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 38716#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 38739#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 38738#L12-2 call write~int#0(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; 38737#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 38734#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38729#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 38695#L12-2 [2024-11-19 14:23:53,907 INFO L747 eck$LassoCheckResult]: Loop: 38695#L12-2 call write~int#0(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; 38733#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 38731#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38728#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 38695#L12-2 [2024-11-19 14:23:53,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1970738202, now seen corresponding path program 5 times [2024-11-19 14:23:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:53,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265193594] [2024-11-19 14:23:53,907 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:53,927 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-19 14:23:53,927 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 14:23:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265193594] [2024-11-19 14:23:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265193594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068581472] [2024-11-19 14:23:53,994 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:53,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:53,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:53,996 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:53,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2024-11-19 14:23:54,118 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-19 14:23:54,118 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:54,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:23:54,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 14:23:54,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 14:23:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068581472] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:54,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:54,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2024-11-19 14:23:54,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797054299] [2024-11-19 14:23:54,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:54,202 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:54,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 3 times [2024-11-19 14:23:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876660221] [2024-11-19 14:23:54,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:23:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:54,206 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:23:54,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:54,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:54,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:23:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:23:54,304 INFO L87 Difference]: Start difference. First operand 1225 states and 1520 transitions. cyclomatic complexity: 342 Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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) [2024-11-19 14:23:54,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:54,365 INFO L93 Difference]: Finished difference Result 1281 states and 1576 transitions. [2024-11-19 14:23:54,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1281 states and 1576 transitions. [2024-11-19 14:23:54,370 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 294 [2024-11-19 14:23:54,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1281 states to 1281 states and 1576 transitions. [2024-11-19 14:23:54,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1079 [2024-11-19 14:23:54,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1079 [2024-11-19 14:23:54,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1281 states and 1576 transitions. [2024-11-19 14:23:54,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:54,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1281 states and 1576 transitions. [2024-11-19 14:23:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states and 1576 transitions. [2024-11-19 14:23:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1259. [2024-11-19 14:23:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1184 states have (on average 1.2043918918918919) internal successors, (1426), 1182 states have internal predecessors, (1426), 43 states have call successors, (45), 28 states have call predecessors, (45), 32 states have return successors, (83), 48 states have call predecessors, (83), 40 states have call successors, (83) [2024-11-19 14:23:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1554 transitions. [2024-11-19 14:23:54,390 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1259 states and 1554 transitions. [2024-11-19 14:23:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:23:54,393 INFO L425 stractBuchiCegarLoop]: Abstraction has 1259 states and 1554 transitions. [2024-11-19 14:23:54,394 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-19 14:23:54,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1259 states and 1554 transitions. [2024-11-19 14:23:54,397 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 294 [2024-11-19 14:23:54,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:54,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:54,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:54,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:23:54,398 INFO L745 eck$LassoCheckResult]: Stem: 41364#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 41309#L-1 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; 41310#L35 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; 41314#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 41315#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 41316#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 41317#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 41372#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 41377#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 41375#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 41376#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 41619#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 41361#L40-4 havoc main_~i~1#1; 41298#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 41370#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41371#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 41333#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41334#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41343#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 41357#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41457#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41459#L24 assume ~n#1 < 2; 41458#merge_sortFINAL assume true; 41456#merge_sortEXIT >#88#return; 41350#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41450#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41530#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 41462#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41464#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41472#L24 assume ~n#1 < 2; 41473#merge_sortFINAL assume true; 41461#merge_sortEXIT >#88#return; 41463#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41529#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41474#L24 assume ~n#1 < 2; 41470#merge_sortFINAL assume true; 41471#merge_sortEXIT >#90#return; 41528#L28 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; 41527#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41526#L12 assume !(merge_~j~0#1 == merge_~n#1); 41525#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41523#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 41524#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 41430#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41431#L12-2 call write~int#0(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; 41421#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41422#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41413#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 41414#L12-2 call write~int#0(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; 41383#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41382#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 41381#L11-4 merge_~i~0#1 := 0; 41380#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 41349#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 41352#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 41353#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 41813#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41811#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41809#L8 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; 41808#merge_sortFINAL assume true; 41805#merge_sortEXIT >#90#return; 41803#L28 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; 41801#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41799#L12 assume !(merge_~j~0#1 == merge_~n#1); 41797#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41793#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 41794#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 41836#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41834#L12-2 call write~int#0(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; 41831#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41828#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41825#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 41754#L12-2 [2024-11-19 14:23:54,398 INFO L747 eck$LassoCheckResult]: Loop: 41754#L12-2 call write~int#0(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; 41690#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41684#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41685#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 41754#L12-2 [2024-11-19 14:23:54,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash 351666664, now seen corresponding path program 6 times [2024-11-19 14:23:54,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:54,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592311397] [2024-11-19 14:23:54,399 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:23:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:54,426 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-11-19 14:23:54,427 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 14:23:54,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:54,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592311397] [2024-11-19 14:23:54,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592311397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:54,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929652824] [2024-11-19 14:23:54,541 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:23:54,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:54,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:54,544 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:54,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2024-11-19 14:23:54,698 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-11-19 14:23:54,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:23:54,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 14:23:54,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 14:23:54,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 14:23:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929652824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:54,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-19 14:23:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138050849] [2024-11-19 14:23:54,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:54,818 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:54,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 4 times [2024-11-19 14:23:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:54,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490333459] [2024-11-19 14:23:54,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:23:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:54,822 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:23:54,822 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:54,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:54,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:54,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:54,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 14:23:54,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:23:54,882 INFO L87 Difference]: Start difference. First operand 1259 states and 1554 transitions. cyclomatic complexity: 342 Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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) [2024-11-19 14:23:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:54,969 INFO L93 Difference]: Finished difference Result 1753 states and 2142 transitions. [2024-11-19 14:23:54,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1753 states and 2142 transitions. [2024-11-19 14:23:54,976 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 494 [2024-11-19 14:23:54,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1753 states to 1751 states and 2140 transitions. [2024-11-19 14:23:54,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1479 [2024-11-19 14:23:54,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1479 [2024-11-19 14:23:54,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1751 states and 2140 transitions. [2024-11-19 14:23:54,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:54,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1751 states and 2140 transitions. [2024-11-19 14:23:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states and 2140 transitions. [2024-11-19 14:23:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1466. [2024-11-19 14:23:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1391 states have (on average 1.203450754852624) internal successors, (1674), 1387 states have internal predecessors, (1674), 43 states have call successors, (45), 28 states have call predecessors, (45), 32 states have return successors, (83), 50 states have call predecessors, (83), 40 states have call successors, (83) [2024-11-19 14:23:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1802 transitions. [2024-11-19 14:23:55,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1466 states and 1802 transitions. [2024-11-19 14:23:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:23:55,003 INFO L425 stractBuchiCegarLoop]: Abstraction has 1466 states and 1802 transitions. [2024-11-19 14:23:55,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-19 14:23:55,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1466 states and 1802 transitions. [2024-11-19 14:23:55,011 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 350 [2024-11-19 14:23:55,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:55,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:55,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:55,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:55,011 INFO L745 eck$LassoCheckResult]: Stem: 44826#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 44767#L-1 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; 44768#L35 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; 44772#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 44773#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 44774#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 44775#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 44833#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 44837#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 44836#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 44776#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 44777#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 44829#L40-4 havoc main_~i~1#1; 44755#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 44834#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 44929#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 44803#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 44794#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 44804#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 44782#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 44922#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 44924#L24 assume ~n#1 < 2; 44923#merge_sortFINAL assume true; 44921#merge_sortEXIT >#88#return; 44811#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 44915#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 45336#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 44926#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 44928#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 44944#L24 assume ~n#1 < 2; 44942#merge_sortFINAL assume true; 44925#merge_sortEXIT >#88#return; 44927#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 45333#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 44941#L24 assume ~n#1 < 2; 44939#merge_sortFINAL assume true; 44940#merge_sortEXIT >#90#return; 45332#L28 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; 45331#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 45330#L12 assume !(merge_~j~0#1 == merge_~n#1); 45329#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 45328#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 45327#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 45326#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 45325#L12-2 call write~int#0(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; 45324#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 44904#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 44905#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 44847#L12-2 call write~int#0(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; 44848#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 44843#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 44844#L11-4 merge_~i~0#1 := 0; 44838#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 44839#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 44816#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 44810#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 44813#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 45407#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 45404#L8 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; 45400#merge_sortFINAL assume true; 45399#merge_sortEXIT >#90#return; 45395#L28 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; 45394#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 45393#L12 assume !(merge_~j~0#1 == merge_~n#1); 45392#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 45389#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 45390#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 45419#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 45418#L12-2 call write~int#0(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; 45417#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 45416#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 45415#L12 assume !(merge_~j~0#1 == merge_~n#1); 45376#L13 [2024-11-19 14:23:55,012 INFO L747 eck$LassoCheckResult]: Loop: 45376#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 45450#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 45449#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 45351#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 45344#L12-2 call write~int#0(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; 45299#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 45300#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 45451#L12 assume !(merge_~j~0#1 == merge_~n#1); 45376#L13 [2024-11-19 14:23:55,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash 351666666, now seen corresponding path program 7 times [2024-11-19 14:23:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:55,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491499408] [2024-11-19 14:23:55,012 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:23:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 29 proven. 37 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 14:23:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491499408] [2024-11-19 14:23:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491499408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333888999] [2024-11-19 14:23:55,289 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:23:55,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:55,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:55,290 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:55,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2024-11-19 14:23:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:55,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 14:23:55,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 14:23:55,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 28 proven. 38 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 14:23:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333888999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:55,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 24 [2024-11-19 14:23:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502038032] [2024-11-19 14:23:55,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:55,653 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:55,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash 617079631, now seen corresponding path program 6 times [2024-11-19 14:23:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:55,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821575222] [2024-11-19 14:23:55,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:23:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:55,657 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:23:55,657 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:55,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:55,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:55,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 14:23:55,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-11-19 14:23:55,838 INFO L87 Difference]: Start difference. First operand 1466 states and 1802 transitions. cyclomatic complexity: 392 Second operand has 24 states, 20 states have (on average 3.15) internal successors, (63), 21 states have internal predecessors, (63), 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) [2024-11-19 14:23:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:56,065 INFO L93 Difference]: Finished difference Result 1782 states and 2177 transitions. [2024-11-19 14:23:56,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1782 states and 2177 transitions. [2024-11-19 14:23:56,071 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 378 [2024-11-19 14:23:56,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1782 states to 1695 states and 2076 transitions. [2024-11-19 14:23:56,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1359 [2024-11-19 14:23:56,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1367 [2024-11-19 14:23:56,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1695 states and 2076 transitions. [2024-11-19 14:23:56,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:56,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1695 states and 2076 transitions. [2024-11-19 14:23:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states and 2076 transitions. [2024-11-19 14:23:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1520. [2024-11-19 14:23:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1438 states have (on average 1.2009735744089012) internal successors, (1727), 1435 states have internal predecessors, (1727), 47 states have call successors, (49), 32 states have call predecessors, (49), 35 states have return successors, (86), 52 states have call predecessors, (86), 43 states have call successors, (86) [2024-11-19 14:23:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1862 transitions. [2024-11-19 14:23:56,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1520 states and 1862 transitions. [2024-11-19 14:23:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 14:23:56,099 INFO L425 stractBuchiCegarLoop]: Abstraction has 1520 states and 1862 transitions. [2024-11-19 14:23:56,099 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-19 14:23:56,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1520 states and 1862 transitions. [2024-11-19 14:23:56,102 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 350 [2024-11-19 14:23:56,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:56,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:56,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:56,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:23:56,103 INFO L745 eck$LassoCheckResult]: Stem: 48537#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 48484#L-1 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; 48485#L35 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; 48489#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 48490#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 48491#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 48492#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 48493#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 48557#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 48555#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 48556#L40-4 havoc main_~i~1#1; 48474#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 48656#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 48653#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 48647#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 48649#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 48654#L24 assume ~n#1 < 2; 48651#merge_sortFINAL assume true; 48646#merge_sortEXIT >#88#return; 48527#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 48645#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 48642#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 48643#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49106#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49109#L24 assume ~n#1 < 2; 49108#merge_sortFINAL assume true; 49105#merge_sortEXIT >#88#return; 48633#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 48634#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 48640#L24 assume ~n#1 < 2; 48635#merge_sortFINAL assume true; 48632#merge_sortEXIT >#90#return; 48631#L28 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; 48630#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 48629#L12 assume !(merge_~j~0#1 == merge_~n#1); 48628#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 48627#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 48625#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 48622#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 48623#L12-2 call write~int#0(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; 49086#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 48613#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 48614#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 48568#L12-2 call write~int#0(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; 48569#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 48564#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 48565#L11-4 merge_~i~0#1 := 0; 48558#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 48559#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 48529#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 48526#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 48528#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 49276#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 49613#L8 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; 49611#merge_sortFINAL assume true; 49603#merge_sortEXIT >#90#return; 49604#L28 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; 49675#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 49674#L12 assume !(merge_~j~0#1 == merge_~n#1); 49673#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 49671#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 49670#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 49669#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 49668#L12-2 call write~int#0(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; 49667#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 49666#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 49663#L12 assume !(merge_~j~0#1 == merge_~n#1); 49664#L13 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 49964#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 49962#L12-2 call write~int#0(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; 48532#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 48533#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 48535#L11-4 merge_~i~0#1 := 0; 48525#L17-3 [2024-11-19 14:23:56,104 INFO L747 eck$LassoCheckResult]: Loop: 48525#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 48524#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 48525#L17-3 [2024-11-19 14:23:56,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash 219246577, now seen corresponding path program 1 times [2024-11-19 14:23:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:56,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144942370] [2024-11-19 14:23:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:23:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144942370] [2024-11-19 14:23:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144942370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:23:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671246082] [2024-11-19 14:23:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:23:56,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:23:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:23:56,261 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:23:56,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2024-11-19 14:23:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:23:56,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:23:56,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:23:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:56,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:23:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:23:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671246082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:23:56,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:23:56,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2024-11-19 14:23:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462220146] [2024-11-19 14:23:56,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:23:56,579 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:23:56,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times [2024-11-19 14:23:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:56,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194626227] [2024-11-19 14:23:56,579 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:56,583 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:23:56,583 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:56,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:56,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:56,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:23:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 14:23:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-19 14:23:56,631 INFO L87 Difference]: Start difference. First operand 1520 states and 1862 transitions. cyclomatic complexity: 399 Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 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) [2024-11-19 14:23:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:23:56,745 INFO L93 Difference]: Finished difference Result 1644 states and 2006 transitions. [2024-11-19 14:23:56,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1644 states and 2006 transitions. [2024-11-19 14:23:56,751 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 350 [2024-11-19 14:23:56,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1644 states to 1637 states and 1998 transitions. [2024-11-19 14:23:56,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1318 [2024-11-19 14:23:56,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1318 [2024-11-19 14:23:56,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1637 states and 1998 transitions. [2024-11-19 14:23:56,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:23:56,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1637 states and 1998 transitions. [2024-11-19 14:23:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states and 1998 transitions. [2024-11-19 14:23:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1542. [2024-11-19 14:23:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1460 states have (on average 1.2013698630136986) internal successors, (1754), 1457 states have internal predecessors, (1754), 47 states have call successors, (49), 32 states have call predecessors, (49), 35 states have return successors, (86), 52 states have call predecessors, (86), 43 states have call successors, (86) [2024-11-19 14:23:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1889 transitions. [2024-11-19 14:23:56,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1542 states and 1889 transitions. [2024-11-19 14:23:56,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 14:23:56,786 INFO L425 stractBuchiCegarLoop]: Abstraction has 1542 states and 1889 transitions. [2024-11-19 14:23:56,786 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-19 14:23:56,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1542 states and 1889 transitions. [2024-11-19 14:23:56,789 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 350 [2024-11-19 14:23:56,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:23:56,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:23:56,790 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:56,790 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:23:56,790 INFO L745 eck$LassoCheckResult]: Stem: 52180#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 52117#L-1 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; 52118#L35 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; 52122#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 52123#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 52195#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 52196#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 52124#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 52125#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 52190#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 52191#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 52194#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 52200#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 52197#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 52199#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 52192#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 52193#L40-4 havoc main_~i~1#1; 52103#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 52188#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52173#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 52151#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 52146#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52152#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 52213#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 52292#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52297#L24 assume ~n#1 < 2; 52294#merge_sortFINAL assume true; 52290#merge_sortEXIT >#88#return; 52167#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 52309#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52749#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 52279#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 52281#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52286#L24 assume ~n#1 < 2; 52283#merge_sortFINAL assume true; 52278#merge_sortEXIT >#88#return; 52280#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 52746#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52753#L24 assume ~n#1 < 2; 52752#merge_sortFINAL assume true; 52745#merge_sortEXIT >#90#return; 52744#L28 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; 52743#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52742#L12 assume !(merge_~j~0#1 == merge_~n#1); 52741#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 52740#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 52734#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 52733#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 52263#L12-2 call write~int#0(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; 52260#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 52261#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52254#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 52209#L12-2 call write~int#0(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; 52210#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 52205#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 52206#L11-4 merge_~i~0#1 := 0; 52201#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 52202#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 52166#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 52169#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 52711#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 52710#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 52708#L8 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; 52706#merge_sortFINAL assume true; 52703#merge_sortEXIT >#90#return; 52701#L28 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; 52828#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52827#L12 assume !(merge_~j~0#1 == merge_~n#1); 52826#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 52823#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 52824#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 52825#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 52822#L12-2 call write~int#0(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; 52820#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 52817#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52814#L12 assume !(merge_~j~0#1 == merge_~n#1); 52790#L13 [2024-11-19 14:23:56,791 INFO L747 eck$LassoCheckResult]: Loop: 52790#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 52789#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 52788#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 52776#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 52777#L12-2 call write~int#0(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; 52834#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 52833#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52791#L12 assume !(merge_~j~0#1 == merge_~n#1); 52790#L13 [2024-11-19 14:23:56,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash -178955738, now seen corresponding path program 8 times [2024-11-19 14:23:56,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:56,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972923014] [2024-11-19 14:23:56,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:23:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:56,828 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:23:56,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:56,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:56,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:56,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash 617079631, now seen corresponding path program 7 times [2024-11-19 14:23:56,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:56,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826380265] [2024-11-19 14:23:56,861 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:23:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:56,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:56,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:23:56,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:23:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1913079924, now seen corresponding path program 5 times [2024-11-19 14:23:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:23:56,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899359592] [2024-11-19 14:23:56,871 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:23:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:23:56,910 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-19 14:23:56,911 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:23:56,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:23:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:23:56,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:24:03,069 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:24:03,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:24:03,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:24:03,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:24:03,070 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:24:03,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:03,070 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:24:03,070 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:24:03,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration27_Lasso [2024-11-19 14:24:03,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:24:03,070 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:24:03,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:03,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:04,276 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:24:04,276 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:24:04,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,278 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2024-11-19 14:24:04,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2024-11-19 14:24:04,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,304 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-11-19 14:24:04,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 [2024-11-19 14:24:04,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:04,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,329 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2024-11-19 14:24:04,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 [2024-11-19 14:24:04,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-11-19 14:24:04,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,353 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2024-11-19 14:24:04,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:04,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,377 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2024-11-19 14:24:04,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2024-11-19 14:24:04,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,401 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2024-11-19 14:24:04,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2024-11-19 14:24:04,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,424 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2024-11-19 14:24:04,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2024-11-19 14:24:04,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,446 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2024-11-19 14:24:04,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,458 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2024-11-19 14:24:04,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,469 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2024-11-19 14:24:04,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:04,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,493 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2024-11-19 14:24:04,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2024-11-19 14:24:04,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,516 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2024-11-19 14:24:04,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2024-11-19 14:24:04,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,561 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2024-11-19 14:24:04,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 [2024-11-19 14:24:04,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2024-11-19 14:24:04,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,584 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2024-11-19 14:24:04,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 [2024-11-19 14:24:04,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,596 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2024-11-19 14:24:04,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,607 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2024-11-19 14:24:04,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:04,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,630 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2024-11-19 14:24:04,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:24:04,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:24:04,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2024-11-19 14:24:04,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,655 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2024-11-19 14:24:04,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:24:04,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:24:04,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:04,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,684 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2024-11-19 14:24:04,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 [2024-11-19 14:24:04,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,696 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2024-11-19 14:24:04,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,707 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2024-11-19 14:24:04,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2024-11-19 14:24:04,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,729 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2024-11-19 14:24:04,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 [2024-11-19 14:24:04,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2024-11-19 14:24:04,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,752 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2024-11-19 14:24:04,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2024-11-19 14:24:04,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,775 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2024-11-19 14:24:04,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2024-11-19 14:24:04,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,798 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2024-11-19 14:24:04,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:24:04,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:24:04,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2024-11-19 14:24:04,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,824 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2024-11-19 14:24:04,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:24:04,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:24:04,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:04,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,848 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2024-11-19 14:24:04,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:04,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:04,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:04,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:04,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:04,860 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:04,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2024-11-19 14:24:04,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:04,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:04,871 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:04,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2024-11-19 14:24:04,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 [2024-11-19 14:24:04,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:04,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:04,882 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-19 14:24:04,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:04,917 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-11-19 14:24:04,917 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-19 14:24:05,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:24:06,212 INFO L443 ModelExtractionUtils]: Simplification made 79 calls to the SMT solver. [2024-11-19 14:24:06,212 INFO L444 ModelExtractionUtils]: 18 out of 100 variables were initially zero. Simplification set additionally 78 variables to zero. [2024-11-19 14:24:06,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:06,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:06,213 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:06,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2024-11-19 14:24:06,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:24:06,227 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2024-11-19 14:24:06,227 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:24:06,228 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~a#1.offset, v_rep(select #length merge_sort_#in~a#1.base)_7, merge_sort_merge_~i~0#1) = -1*merge_sort_merge_~a#1.offset + 1*v_rep(select #length merge_sort_#in~a#1.base)_7 - 4*merge_sort_merge_~i~0#1 Supporting invariants [] [2024-11-19 14:24:06,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2024-11-19 14:24:06,281 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-11-19 14:24:06,282 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:24:06,282 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:24:06,282 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset [2024-11-19 14:24:06,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:06,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 14:24:06,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:06,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:24:06,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:06,630 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-11-19 14:24:06,630 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1542 states and 1889 transitions. cyclomatic complexity: 404 Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:06,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1542 states and 1889 transitions. cyclomatic complexity: 404. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1729 states and 2094 transitions. Complement of second has 12 states. [2024-11-19 14:24:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:24:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2024-11-19 14:24:06,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 76 letters. Loop has 8 letters. [2024-11-19 14:24:06,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:06,717 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:24:06,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:06,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 14:24:06,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:07,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:24:07,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:07,078 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2024-11-19 14:24:07,078 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1542 states and 1889 transitions. cyclomatic complexity: 404 Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:07,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1542 states and 1889 transitions. cyclomatic complexity: 404. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1774 states and 2136 transitions. Complement of second has 14 states. [2024-11-19 14:24:07,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:24:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2024-11-19 14:24:07,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 76 letters. Loop has 8 letters. [2024-11-19 14:24:07,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:07,187 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:24:07,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:07,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 14:24:07,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:07,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:24:07,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:07,559 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-11-19 14:24:07,559 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1542 states and 1889 transitions. cyclomatic complexity: 404 Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:07,670 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1542 states and 1889 transitions. cyclomatic complexity: 404. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2827 states and 3407 transitions. Complement of second has 25 states. [2024-11-19 14:24:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-19 14:24:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2024-11-19 14:24:07,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 76 letters. Loop has 8 letters. [2024-11-19 14:24:07,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:07,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 84 letters. Loop has 8 letters. [2024-11-19 14:24:07,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:07,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 63 transitions. Stem has 76 letters. Loop has 16 letters. [2024-11-19 14:24:07,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:07,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2827 states and 3407 transitions. [2024-11-19 14:24:07,681 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 146 [2024-11-19 14:24:07,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2827 states to 2599 states and 3062 transitions. [2024-11-19 14:24:07,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1136 [2024-11-19 14:24:07,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1489 [2024-11-19 14:24:07,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2599 states and 3062 transitions. [2024-11-19 14:24:07,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:24:07,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2599 states and 3062 transitions. [2024-11-19 14:24:07,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states and 3062 transitions. [2024-11-19 14:24:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2008. [2024-11-19 14:24:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 1926 states have (on average 1.1832814122533748) internal successors, (2279), 1923 states have internal predecessors, (2279), 47 states have call successors, (49), 32 states have call predecessors, (49), 35 states have return successors, (86), 52 states have call predecessors, (86), 43 states have call successors, (86) [2024-11-19 14:24:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2414 transitions. [2024-11-19 14:24:07,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2008 states and 2414 transitions. [2024-11-19 14:24:07,715 INFO L425 stractBuchiCegarLoop]: Abstraction has 2008 states and 2414 transitions. [2024-11-19 14:24:07,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-19 14:24:07,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2008 states and 2414 transitions. [2024-11-19 14:24:07,719 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 146 [2024-11-19 14:24:07,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:24:07,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:24:07,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:24:07,720 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:24:07,720 INFO L745 eck$LassoCheckResult]: Stem: 60968#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 60908#L-1 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; 60909#L35 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; 60913#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 60914#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 60981#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 60982#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 60915#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 60916#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 60975#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 60976#L40-4 havoc main_~i~1#1; 60889#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 60890#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 61154#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 60929#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 60930#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 61512#L24 assume ~n#1 < 2; 61513#merge_sortFINAL assume true; 61509#merge_sortEXIT >#88#return; 60954#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 60998#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 60999#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 61756#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 61757#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 61760#L24 assume ~n#1 < 2; 61759#merge_sortFINAL assume true; 61755#merge_sortEXIT >#88#return; 61752#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 61753#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 61758#L24 assume ~n#1 < 2; 61754#merge_sortFINAL assume true; 61751#merge_sortEXIT >#90#return; 61750#L28 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; 61749#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 61748#L12 assume !(merge_~j~0#1 == merge_~n#1); 61746#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 61744#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 61743#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 61742#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 61741#L12-2 call write~int#0(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; 61740#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 61739#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 61737#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 61516#L12-2 call write~int#0(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; 61517#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 60992#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 60993#L11-4 merge_~i~0#1 := 0; 60986#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 60987#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 60958#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 60953#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 60955#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 61829#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 62296#L8 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; 62295#merge_sortFINAL assume true; 62294#merge_sortEXIT >#90#return; 62293#L28 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; 62292#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 62291#L12 assume !(merge_~j~0#1 == merge_~n#1); 62289#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 62287#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 62286#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 62284#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 62285#L12-2 call write~int#0(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; 62280#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 62281#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 62276#L12 assume !(merge_~j~0#1 == merge_~n#1); 62277#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 62273#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 62271#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 62270#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 62269#L12-2 call write~int#0(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; 62268#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 62267#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 62265#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 62266#L12-2 call write~int#0(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; 61949#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 61839#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 61838#L11-4 merge_~i~0#1 := 0; 60952#L17-3 [2024-11-19 14:24:07,720 INFO L747 eck$LassoCheckResult]: Loop: 60952#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 60949#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 60952#L17-3 [2024-11-19 14:24:07,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:07,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1300508302, now seen corresponding path program 9 times [2024-11-19 14:24:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:24:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605599318] [2024-11-19 14:24:07,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:24:07,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:24:07,767 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 14:24:07,768 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:24:07,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:24:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:24:07,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:24:07,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 6 times [2024-11-19 14:24:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:24:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431765935] [2024-11-19 14:24:07,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:24:07,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:24:07,802 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:24:07,802 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:24:07,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:24:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:24:07,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:24:07,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash -47003312, now seen corresponding path program 10 times [2024-11-19 14:24:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:24:07,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56461303] [2024-11-19 14:24:07,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:24:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:24:07,839 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:24:07,839 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:24:07,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:24:07,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:24:07,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:24:17,770 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:24:17,770 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:24:17,770 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:24:17,770 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:24:17,770 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:24:17,770 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:17,770 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:24:17,770 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:24:17,770 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration28_Lasso [2024-11-19 14:24:17,770 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:24:17,770 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:24:17,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:17,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:18,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:18,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:18,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:18,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:18,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:18,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:24:19,371 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:24:19,371 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:24:19,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,373 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2024-11-19 14:24:19,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2024-11-19 14:24:19,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,398 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2024-11-19 14:24:19,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2024-11-19 14:24:19,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,422 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2024-11-19 14:24:19,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2024-11-19 14:24:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,445 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2024-11-19 14:24:19,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2024-11-19 14:24:19,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,468 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2024-11-19 14:24:19,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2024-11-19 14:24:19,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,492 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2024-11-19 14:24:19,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,504 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2024-11-19 14:24:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,515 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2024-11-19 14:24:19,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2024-11-19 14:24:19,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,538 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2024-11-19 14:24:19,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,550 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2024-11-19 14:24:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,561 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2024-11-19 14:24:19,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 [2024-11-19 14:24:19,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:19,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,583 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2024-11-19 14:24:19,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 [2024-11-19 14:24:19,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2024-11-19 14:24:19,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,606 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2024-11-19 14:24:19,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2024-11-19 14:24:19,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,629 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2024-11-19 14:24:19,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,645 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2024-11-19 14:24:19,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,656 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2024-11-19 14:24:19,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2024-11-19 14:24:19,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,679 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2024-11-19 14:24:19,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2024-11-19 14:24:19,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,702 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2024-11-19 14:24:19,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2024-11-19 14:24:19,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,724 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2024-11-19 14:24:19,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2024-11-19 14:24:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,747 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2024-11-19 14:24:19,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2024-11-19 14:24:19,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,769 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2024-11-19 14:24:19,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2024-11-19 14:24:19,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,792 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2024-11-19 14:24:19,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2024-11-19 14:24:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,814 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2024-11-19 14:24:19,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2024-11-19 14:24:19,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,837 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2024-11-19 14:24:19,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2024-11-19 14:24:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,859 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2024-11-19 14:24:19,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,872 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2024-11-19 14:24:19,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,883 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2024-11-19 14:24:19,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:24:19,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:24:19,896 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2024-11-19 14:24:19,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,910 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2024-11-19 14:24:19,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,922 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2024-11-19 14:24:19,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,933 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2024-11-19 14:24:19,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2024-11-19 14:24:19,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,956 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2024-11-19 14:24:19,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:24:19,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:24:19,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:24:19,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:19,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2024-11-19 14:24:19,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:19,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:19,979 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:19,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2024-11-19 14:24:19,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:19,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:19,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:19,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:19,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:19,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:24:19,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:24:19,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:24:20,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2024-11-19 14:24:20,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:20,004 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:20,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2024-11-19 14:24:20,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:24:20,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:24:20,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:24:20,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:24:20,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:24:20,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:24:20,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:24:20,026 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:24:20,035 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-19 14:24:20,035 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. [2024-11-19 14:24:20,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:24:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:20,036 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 14:24:20,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2024-11-19 14:24:20,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:24:20,046 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:24:20,047 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:24:20,047 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~i~0#1 + 1*merge_sort_merge_~n#1 Supporting invariants [] [2024-11-19 14:24:20,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Forceful destruction successful, exit code 0 [2024-11-19 14:24:20,133 INFO L156 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2024-11-19 14:24:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:20,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:24:20,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:20,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:24:20,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:20,439 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 [2024-11-19 14:24:20,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2008 states and 2414 transitions. cyclomatic complexity: 489 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:20,474 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2008 states and 2414 transitions. cyclomatic complexity: 489. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2020 states and 2431 transitions. Complement of second has 7 states. [2024-11-19 14:24:20,474 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 [2024-11-19 14:24:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-19 14:24:20,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 79 letters. Loop has 2 letters. [2024-11-19 14:24:20,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:20,475 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:24:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:20,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:24:20,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:20,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:24:20,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:20,771 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-19 14:24:20,771 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2008 states and 2414 transitions. cyclomatic complexity: 489 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:20,799 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2008 states and 2414 transitions. cyclomatic complexity: 489. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2020 states and 2431 transitions. Complement of second has 7 states. [2024-11-19 14:24:20,800 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 [2024-11-19 14:24:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-19 14:24:20,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 79 letters. Loop has 2 letters. [2024-11-19 14:24:20,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:20,801 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:24:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:20,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:24:20,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:24:21,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:24:21,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:24:21,129 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-19 14:24:21,129 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2008 states and 2414 transitions. cyclomatic complexity: 489 Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:21,158 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2008 states and 2414 transitions. cyclomatic complexity: 489. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2048 states and 2474 transitions. Complement of second has 9 states. [2024-11-19 14:24:21,163 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 [2024-11-19 14:24:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 14:24:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2024-11-19 14:24:21,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 79 letters. Loop has 2 letters. [2024-11-19 14:24:21,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:21,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 81 letters. Loop has 2 letters. [2024-11-19 14:24:21,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:21,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 79 letters. Loop has 4 letters. [2024-11-19 14:24:21,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:24:21,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2048 states and 2474 transitions. [2024-11-19 14:24:21,173 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 116 [2024-11-19 14:24:21,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2048 states to 1655 states and 1993 transitions. [2024-11-19 14:24:21,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 863 [2024-11-19 14:24:21,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 876 [2024-11-19 14:24:21,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1655 states and 1993 transitions. [2024-11-19 14:24:21,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:24:21,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1655 states and 1993 transitions. [2024-11-19 14:24:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states and 1993 transitions. [2024-11-19 14:24:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1461. [2024-11-19 14:24:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1392 states have (on average 1.1817528735632183) internal successors, (1645), 1390 states have internal predecessors, (1645), 42 states have call successors, (44), 27 states have call predecessors, (44), 27 states have return successors, (76), 43 states have call predecessors, (76), 36 states have call successors, (76) [2024-11-19 14:24:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1765 transitions. [2024-11-19 14:24:21,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1461 states and 1765 transitions. [2024-11-19 14:24:21,199 INFO L425 stractBuchiCegarLoop]: Abstraction has 1461 states and 1765 transitions. [2024-11-19 14:24:21,199 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2024-11-19 14:24:21,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1461 states and 1765 transitions. [2024-11-19 14:24:21,202 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 88 [2024-11-19 14:24:21,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:24:21,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:24:21,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 14:24:21,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:24:21,203 INFO L745 eck$LassoCheckResult]: Stem: 69926#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 69875#L-1 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; 69876#L35 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; 69880#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 69881#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 69934#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 69932#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 69933#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 69935#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 69882#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(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; 69883#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 69884#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 69939#L40-4 havoc main_~i~1#1; 69857#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 69858#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 69966#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 69948#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 69949#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70338#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 70334#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 70335#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70339#L24 assume ~n#1 < 2; 70337#merge_sortFINAL assume true; 70333#merge_sortEXIT >#88#return; 70330#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 70331#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70336#L24 assume ~n#1 < 2; 70332#merge_sortFINAL assume true; 70329#merge_sortEXIT >#90#return; 70328#L28 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; 70326#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 70324#L12 assume !(merge_~j~0#1 == merge_~n#1); 70319#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 70314#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 70310#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 70306#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 70303#L12-2 call write~int#0(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; 70300#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 70296#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 70293#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 70292#L12-2 call write~int#0(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; 70291#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 70290#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 70289#L11-4 merge_~i~0#1 := 0; 70288#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 70287#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 70286#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 70285#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 70284#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 70281#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 70279#L8 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; 70275#merge_sortFINAL assume true; 70273#merge_sortEXIT >#88#return; 69867#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 70985#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70984#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 69894#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 69895#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 69903#L24 assume ~n#1 < 2; 69916#merge_sortFINAL assume true; 71014#merge_sortEXIT >#88#return; 69878#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 69946#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 69947#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 69962#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 69964#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71016#L24 assume ~n#1 < 2; 71015#merge_sortFINAL assume true; 69961#merge_sortEXIT >#88#return; 69963#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 71008#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71010#L24 assume ~n#1 < 2; 71009#merge_sortFINAL assume true; 71007#merge_sortEXIT >#90#return; 71006#L28 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; 71005#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 71004#L12 assume !(merge_~j~0#1 == merge_~n#1); 71003#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 71001#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 71002#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 71013#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 71012#L12-2 call write~int#0(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; 71011#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 70549#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 70550#L12 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 70992#L12-2 call write~int#0(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; 70991#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 70990#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 70989#L11-4 merge_~i~0#1 := 0; 70988#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 70987#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 70986#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 70372#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 70370#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 70371#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 69877#L8 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; 69879#merge_sortFINAL assume true; 69891#merge_sortEXIT >#90#return; 69889#L28 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; 69890#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 69885#L12 assume !(merge_~j~0#1 == merge_~n#1); 69886#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 69899#L14 [2024-11-19 14:24:21,203 INFO L747 eck$LassoCheckResult]: Loop: 69899#L14 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#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 69864#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 69866#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 69924#L12-2 call write~int#0(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; 69917#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 69918#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 71282#L12 assume !(merge_~j~0#1 == merge_~n#1); 71273#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 69899#L14 [2024-11-19 14:24:21,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 341929350, now seen corresponding path program 11 times [2024-11-19 14:24:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:24:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050638923] [2024-11-19 14:24:21,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:24:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:24:21,250 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-19 14:24:21,250 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:24:21,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2024-11-19 14:24:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 43 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-19 14:24:21,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:24:21,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050638923] [2024-11-19 14:24:21,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050638923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:24:21,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799433123] [2024-11-19 14:24:21,988 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:24:21,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:24:21,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:24:21,990 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:24:21,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (216)] Waiting until timeout for monitored process [2024-11-19 14:24:22,400 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-19 14:24:22,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:24:22,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 14:24:22,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:24:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 64 proven. 105 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 14:24:22,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:24:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 70 proven. 104 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 14:24:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799433123] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:24:23,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:24:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29, 30] total 54 [2024-11-19 14:24:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767258553] [2024-11-19 14:24:23,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:24:23,386 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:24:23,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:24:23,387 INFO L85 PathProgramCache]: Analyzing trace with hash -910273611, now seen corresponding path program 4 times [2024-11-19 14:24:23,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:24:23,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107925054] [2024-11-19 14:24:23,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:24:23,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:24:23,391 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:24:23,391 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:24:23,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:24:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:24:23,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:24:23,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:24:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-19 14:24:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2638, Unknown=0, NotChecked=0, Total=2862 [2024-11-19 14:24:23,535 INFO L87 Difference]: Start difference. First operand 1461 states and 1765 transitions. cyclomatic complexity: 365 Second operand has 54 states, 49 states have (on average 2.9591836734693877) internal successors, (145), 46 states have internal predecessors, (145), 14 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16)