./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-09 15:28:20,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:28:20,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:28:20,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:28:20,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:28:20,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:28:20,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:28:20,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:28:20,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:28:20,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:28:20,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:28:20,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:28:20,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:28:20,439 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:28:20,439 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:28:20,439 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:28:20,439 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:28:20,440 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:28:20,440 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:28:20,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:28:20,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:28:20,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:28:20,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:28:20,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:28:20,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:28:20,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:28:20,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:28:20,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:28:20,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:28:20,443 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:28:20,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:28:20,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:28:20,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:28:20,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:28:20,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:28:20,445 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:28:20,445 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-09 15:28:20,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:28:20,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:28:20,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:28:20,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:28:20,655 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:28:20,656 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-09 15:28:21,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:28:22,119 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:28:22,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2024-11-09 15:28:22,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a411e58/4316ab3aa86945e08d778a10ccd2e063/FLAG186ba573c [2024-11-09 15:28:22,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a411e58/4316ab3aa86945e08d778a10ccd2e063 [2024-11-09 15:28:22,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:28:22,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:28:22,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:22,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:28:22,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:28:22,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630347be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22, skipping insertion in model container [2024-11-09 15:28:22,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:28:22,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:22,772 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:28:22,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:22,806 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:28:22,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22 WrapperNode [2024-11-09 15:28:22,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:22,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:22,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:28:22,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:28:22,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,835 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-11-09 15:28:22,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:22,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:28:22,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:28:22,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:28:22,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,870 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [8, 2]. 80 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2024-11-09 15:28:22,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:28:22,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:28:22,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:28:22,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:28:22,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (1/1) ... [2024-11-09 15:28:22,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:22,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:22,921 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-09 15:28:22,924 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-09 15:28:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:28:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:28:22,959 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2024-11-09 15:28:22,960 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2024-11-09 15:28:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:28:22,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:28:22,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:28:22,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:28:22,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:28:22,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:28:23,018 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:28:23,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:28:23,208 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-09 15:28:23,209 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:28:23,217 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:28:23,217 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 15:28:23,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:23 BoogieIcfgContainer [2024-11-09 15:28:23,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:28:23,222 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:28:23,222 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:28:23,225 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:28:23,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:23,226 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:28:22" (1/3) ... [2024-11-09 15:28:23,226 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d405a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:23, skipping insertion in model container [2024-11-09 15:28:23,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:23,227 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:22" (2/3) ... [2024-11-09 15:28:23,227 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d405a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:23, skipping insertion in model container [2024-11-09 15:28:23,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:23,227 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:23" (3/3) ... [2024-11-09 15:28:23,228 INFO L332 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2024-11-09 15:28:23,268 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:28:23,269 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:28:23,269 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:28:23,269 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:28:23,269 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:28:23,269 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:28:23,269 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:28:23,269 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:28:23,272 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-09 15:28:23,285 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-09 15:28:23,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:23,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:23,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:28:23,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:23,290 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:28:23,290 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-09 15:28:23,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-09 15:28:23,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:23,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:23,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:28:23,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:23,298 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-09 15:28:23,298 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#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 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-09 15:28:23,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times [2024-11-09 15:28:23,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:23,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420891107] [2024-11-09 15:28:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:23,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2024-11-09 15:28:23,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:23,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961067990] [2024-11-09 15:28:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:23,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:23,405 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times [2024-11-09 15:28:23,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:23,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682158664] [2024-11-09 15:28:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:23,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:23,602 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:23,602 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:23,602 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:23,603 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:23,603 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:23,603 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:23,603 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:23,603 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:23,603 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2024-11-09 15:28:23,603 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:23,603 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:23,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:23,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:23,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:23,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:23,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:23,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:23,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:23,835 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:23,838 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:23,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:23,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:23,840 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-09 15:28:23,842 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-09 15:28:23,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-09 15:28:23,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:23,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:23,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:23,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:23,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:23,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:23,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:23,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:23,870 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-09 15:28:23,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:23,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:23,872 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-09 15:28:23,873 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-09 15:28:23,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:23,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:23,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:23,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:23,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:23,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:23,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:23,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:23,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:23,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 15:28:23,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:23,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:23,905 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-09 15:28:23,906 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-09 15:28:23,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:23,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:23,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:23,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:23,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:23,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:23,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:23,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:23,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:23,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:28:23,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:23,932 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-09 15:28:23,933 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-09 15:28:23,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-09 15:28:23,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:23,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:23,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:23,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:23,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:23,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:23,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:23,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:23,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-09 15:28:23,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:23,963 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-09 15:28:23,965 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-09 15:28:23,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:23,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:23,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:23,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:23,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:23,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:23,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:23,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:23,978 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:23,989 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-09 15:28:23,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:23,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:23,990 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-09 15:28:23,992 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-09 15:28:23,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-09 15:28:24,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:24,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:24,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:24,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:24,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:24,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:24,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:24,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:24,026 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-09 15:28:24,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:24,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:24,028 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-09 15:28:24,029 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-09 15:28:24,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:24,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:24,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:24,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:24,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:24,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:24,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:24,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:24,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:24,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:24,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:24,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:24,059 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-09 15:28:24,060 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-09 15:28:24,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:24,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:24,072 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:28:24,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:24,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:24,075 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:28:24,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:24,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:24,092 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-09 15:28:24,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:24,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:24,094 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-09 15:28:24,095 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-09 15:28:24,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:24,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:24,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:24,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:24,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:24,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:24,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:24,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:24,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:28:24,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:24,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:24,125 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-09 15:28:24,130 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-09 15:28:24,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:24,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:24,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:24,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:24,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:24,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:24,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:24,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:24,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:28:24,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:24,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:24,159 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-09 15:28:24,160 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-09 15:28:24,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:24,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:24,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:24,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:24,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:24,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:24,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:24,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:24,233 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-09 15:28:24,234 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-09 15:28:24,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:24,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:28:24,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:28:24,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:24,254 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:24,254 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:24,255 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-09 15:28:24,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:28:24,273 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-09 15:28:24,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:24,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:28:24,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:24,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:24,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:24,328 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-09 15:28:24,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-09 15:28:24,379 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-09 15:28:24,380 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-09 15:28:24,439 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-09 15:28:24,442 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-09 15:28:24,445 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-09 15:28:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-11-09 15:28:24,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-09 15:28:24,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:24,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-09 15:28:24,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:24,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-09 15:28:24,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:24,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 85 transitions. [2024-11-09 15:28:24,450 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-09 15:28:24,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 28 states and 39 transitions. [2024-11-09 15:28:24,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-09 15:28:24,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-09 15:28:24,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2024-11-09 15:28:24,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:24,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-11-09 15:28:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2024-11-09 15:28:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 15:28:24,476 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-09 15:28:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-11-09 15:28:24,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-11-09 15:28:24,478 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-11-09 15:28:24,478 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:28:24,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2024-11-09 15:28:24,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-09 15:28:24,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:24,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:24,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:28:24,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:24,480 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-09 15:28:24,480 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-09 15:28:24,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1630387501, now seen corresponding path program 1 times [2024-11-09 15:28:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:24,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854521641] [2024-11-09 15:28:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:24,539 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-09 15:28:24,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854521641] [2024-11-09 15:28:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854521641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:24,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284672164] [2024-11-09 15:28:24,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:24,543 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:24,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 1 times [2024-11-09 15:28:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:24,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145030068] [2024-11-09 15:28:24,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:24,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:28:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:28:24,711 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-09 15:28:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:24,722 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-09 15:28:24,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2024-11-09 15:28:24,723 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-09 15:28:24,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2024-11-09 15:28:24,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-09 15:28:24,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-09 15:28:24,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2024-11-09 15:28:24,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:24,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-09 15:28:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2024-11-09 15:28:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-09 15:28:24,727 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-09 15:28:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-09 15:28:24,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-09 15:28:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:28:24,728 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-09 15:28:24,728 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:28:24,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2024-11-09 15:28:24,729 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-09 15:28:24,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:24,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:24,730 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:24,730 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:24,730 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#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 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-09 15:28:24,732 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-09 15:28:24,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash 862387761, now seen corresponding path program 1 times [2024-11-09 15:28:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759311850] [2024-11-09 15:28:24,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 2 times [2024-11-09 15:28:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757414619] [2024-11-09 15:28:24,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:24,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:24,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1100576510, now seen corresponding path program 1 times [2024-11-09 15:28:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:24,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464259146] [2024-11-09 15:28:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:24,847 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-09 15:28:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464259146] [2024-11-09 15:28:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464259146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971374765] [2024-11-09 15:28:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:24,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:24,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:24,850 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:24,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 15:28:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:24,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:24,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:24,913 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-09 15:28:24,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:24,957 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-09 15:28:24,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971374765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:24,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:24,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-09 15:28:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350537674] [2024-11-09 15:28:24,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:25,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:25,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:28:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:28:25,122 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-09 15:28:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:25,162 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-09 15:28:25,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 45 transitions. [2024-11-09 15:28:25,163 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-09 15:28:25,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 31 states and 39 transitions. [2024-11-09 15:28:25,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-09 15:28:25,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-09 15:28:25,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2024-11-09 15:28:25,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:25,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-09 15:28:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2024-11-09 15:28:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-09 15:28:25,166 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-09 15:28:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 15:28:25,167 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 15:28:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 15:28:25,168 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 15:28:25,168 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:28:25,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2024-11-09 15:28:25,168 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-09 15:28:25,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:25,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:25,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:25,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:25,169 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#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 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#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 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-09 15:28:25,169 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-09 15:28:25,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash -172336625, now seen corresponding path program 2 times [2024-11-09 15:28:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250214505] [2024-11-09 15:28:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:25,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:25,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:25,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 3 times [2024-11-09 15:28:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895144040] [2024-11-09 15:28:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:25,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:25,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1594476444, now seen corresponding path program 2 times [2024-11-09 15:28:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:25,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834098593] [2024-11-09 15:28:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:25,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:25,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:25,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:25,800 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:25,801 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:25,801 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:25,801 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:25,801 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:25,801 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:25,801 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:25,801 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:25,801 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2024-11-09 15:28:25,801 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:25,801 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:25,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:25,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:26,261 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:26,261 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:26,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,263 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-09 15:28:26,264 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-09 15:28:26,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-09 15:28:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,291 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-09 15:28:26,292 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-09 15:28:26,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,317 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-09 15:28:26,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,318 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-09 15:28:26,319 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-09 15:28:26,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,345 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-09 15:28:26,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,347 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-09 15:28:26,350 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-09 15:28:26,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,362 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,375 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-09 15:28:26,378 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-09 15:28:26,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-09 15:28:26,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-09 15:28:26,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,408 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-09 15:28:26,409 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-09 15:28:26,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-09 15:28:26,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,432 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-09 15:28:26,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,434 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-09 15:28:26,435 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-09 15:28:26,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:26,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:28:26,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,461 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-09 15:28:26,461 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-09 15:28:26,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:26,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,488 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-09 15:28:26,489 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-09 15:28:26,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,512 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-09 15:28:26,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,514 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-09 15:28:26,516 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-09 15:28:26,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-09 15:28:26,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,528 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,529 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-09 15:28:26,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,542 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-09 15:28:26,546 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-09 15:28:26,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:26,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,569 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-09 15:28:26,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,571 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-09 15:28:26,573 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-09 15:28:26,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,597 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-09 15:28:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,598 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-09 15:28:26,599 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-09 15:28:26,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:26,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,624 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-09 15:28:26,624 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-09 15:28:26,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:26,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-09 15:28:26,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,648 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-09 15:28:26,649 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-09 15:28:26,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,676 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-09 15:28:26,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-09 15:28:26,681 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-09 15:28:26,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,708 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-09 15:28:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,710 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-09 15:28:26,711 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-09 15:28:26,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-09 15:28:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,752 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-09 15:28:26,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:26,761 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-09 15:28:26,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,804 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-09 15:28:26,806 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-09 15:28:26,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,853 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-09 15:28:26,853 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-09 15:28:26,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,883 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-09 15:28:26,884 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-09 15:28:26,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-09 15:28:26,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,899 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,912 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-09 15:28:26,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,914 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-09 15:28:26,915 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-09 15:28:26,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-09 15:28:26,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,942 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-09 15:28:26,943 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-09 15:28:26,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-09 15:28:26,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,965 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-09 15:28:26,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,966 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-09 15:28:26,967 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-09 15:28:26,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:26,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:26,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:26,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:26,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:26,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:26,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:26,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:26,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:26,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:26,997 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-09 15:28:26,998 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-09 15:28:26,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-09 15:28:27,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,021 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-09 15:28:27,022 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-09 15:28:27,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,045 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-09 15:28:27,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,046 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-09 15:28:27,060 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-09 15:28:27,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,082 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-09 15:28:27,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,083 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-09 15:28:27,084 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-09 15:28:27,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,096 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-09 15:28:27,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,110 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-09 15:28:27,111 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-09 15:28:27,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-09 15:28:27,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,137 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-09 15:28:27,139 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-09 15:28:27,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,150 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:27,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,162 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-09 15:28:27,166 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-09 15:28:27,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,178 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,188 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-09 15:28:27,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,189 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-09 15:28:27,190 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-09 15:28:27,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:27,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,213 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-09 15:28:27,214 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-09 15:28:27,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,236 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-09 15:28:27,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,237 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-09 15:28:27,238 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-09 15:28:27,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,261 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-09 15:28:27,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,262 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-09 15:28:27,263 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-09 15:28:27,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,285 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-09 15:28:27,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,287 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-09 15:28:27,287 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-09 15:28:27,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:27,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:27,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:27,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,309 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-09 15:28:27,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,311 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-09 15:28:27,312 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-09 15:28:27,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-09 15:28:27,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:27,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:27,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,348 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-09 15:28:27,349 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-09 15:28:27,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:27,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,376 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-09 15:28:27,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,377 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-09 15:28:27,387 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-09 15:28:27,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:27,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,398 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-09 15:28:27,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,399 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-09 15:28:27,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,413 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-09 15:28:27,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,414 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-09 15:28:27,415 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-09 15:28:27,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:27,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:27,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:27,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:27,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,443 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-09 15:28:27,444 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-09 15:28:27,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-09 15:28:27,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:27,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:27,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:27,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:27,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:27,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:27,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:27,475 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-09 15:28:27,475 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-09 15:28:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,477 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-09 15:28:27,480 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-09 15:28:27,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:27,492 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:27,492 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:27,492 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-09 15:28:27,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-09 15:28:27,510 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2024-11-09 15:28:27,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:27,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:27,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:27,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:28:27,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:27,570 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-09 15:28:27,570 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-09 15:28:27,570 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-09 15:28:27,603 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-09 15:28:27,603 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-09 15:28:27,604 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-09 15:28:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-09 15:28:27,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 3 letters. [2024-11-09 15:28:27,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:27,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2024-11-09 15:28:27,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:27,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2024-11-09 15:28:27,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:27,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 60 transitions. [2024-11-09 15:28:27,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-09 15:28:27,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 51 transitions. [2024-11-09 15:28:27,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2024-11-09 15:28:27,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-09 15:28:27,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2024-11-09 15:28:27,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:27,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-09 15:28:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2024-11-09 15:28:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-09 15:28:27,609 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-09 15:28:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-09 15:28:27,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-09 15:28:27,610 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-09 15:28:27,610 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:28:27,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 47 transitions. [2024-11-09 15:28:27,610 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-09 15:28:27,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:27,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:27,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:27,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:27,611 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#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 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#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 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-09 15:28:27,611 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-09 15:28:27,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1352366372, now seen corresponding path program 1 times [2024-11-09 15:28:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:27,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496853523] [2024-11-09 15:28:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:27,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:27,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:27,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:27,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:27,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1121289573, now seen corresponding path program 1 times [2024-11-09 15:28:27,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:27,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29717546] [2024-11-09 15:28:27,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:27,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:27,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:27,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:27,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:27,647 INFO L85 PathProgramCache]: Analyzing trace with hash -526901058, now seen corresponding path program 1 times [2024-11-09 15:28:27,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:27,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521277882] [2024-11-09 15:28:27,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:27,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:27,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 15:28:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 15:28:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 15:28:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:27,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521277882] [2024-11-09 15:28:27,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521277882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:27,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888134481] [2024-11-09 15:28:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:27,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:27,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:27,834 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:27,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2024-11-09 15:28:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:27,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 15:28:27,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:27,919 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-09 15:28:27,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:27,984 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-09 15:28:27,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888134481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:27,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:27,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-11-09 15:28:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385086553] [2024-11-09 15:28:27,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:28,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:28,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 15:28:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-09 15:28:28,704 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. cyclomatic complexity: 15 Second operand has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 15:28:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:28,944 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2024-11-09 15:28:28,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2024-11-09 15:28:28,945 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2024-11-09 15:28:28,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 88 transitions. [2024-11-09 15:28:28,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-11-09 15:28:28,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-11-09 15:28:28,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 88 transitions. [2024-11-09 15:28:28,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:28,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-11-09 15:28:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 88 transitions. [2024-11-09 15:28:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-09 15:28:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 15:28:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-11-09 15:28:28,951 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-11-09 15:28:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:28:28,955 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-11-09 15:28:28,955 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:28:28,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2024-11-09 15:28:28,956 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 15:28:28,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:28,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:28,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:28,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:28,957 INFO L745 eck$LassoCheckResult]: Stem: 835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 808#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; 809#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; 811#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 812#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 813#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 814#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 861#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 851#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 850#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 849#L40-4 havoc main_~i~1#1; 802#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 844#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 828#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); 804#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 823#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 827#L24 assume ~n#1 < 2; 832#merge_sortFINAL assume true; 819#merge_sortEXIT >#88#return; 803#L27-1 [2024-11-09 15:28:28,957 INFO L747 eck$LassoCheckResult]: Loop: 803#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 822#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 860#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); 801#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 822#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 860#L24 assume ~n#1 < 2; 820#merge_sortFINAL assume true; 821#merge_sortEXIT >#88#return; 803#L27-1 [2024-11-09 15:28:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1854838534, now seen corresponding path program 2 times [2024-11-09 15:28:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801142635] [2024-11-09 15:28:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:28,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1121289573, now seen corresponding path program 2 times [2024-11-09 15:28:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:28,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460305137] [2024-11-09 15:28:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:28,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:28,985 INFO L85 PathProgramCache]: Analyzing trace with hash 8928416, now seen corresponding path program 2 times [2024-11-09 15:28:28,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:28,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134327626] [2024-11-09 15:28:28,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:28,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:29,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:30,173 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:30,173 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:30,173 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:30,173 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:30,173 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:30,173 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,173 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:30,173 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:30,173 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2024-11-09 15:28:30,173 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:30,174 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:30,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:30,882 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:30,882 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:30,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,884 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-09 15:28:30,885 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-09 15:28:30,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:30,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,908 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-09 15:28:30,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,909 INFO L229 MonitoredProcess]: Starting monitored process 59 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-09 15:28:30,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-09 15:28:30,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-09 15:28:30,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:30,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,934 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-09 15:28:30,935 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-09 15:28:30,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-09 15:28:30,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,962 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-09 15:28:30,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,965 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-09 15:28:30,966 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-09 15:28:30,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:30,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:30,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:30,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:30,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:30,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:30,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:30,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:30,979 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:30,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:30,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:30,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:30,991 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-09 15:28:30,991 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-09 15:28:30,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-09 15:28:31,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,015 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-09 15:28:31,016 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-09 15:28:31,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,040 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-09 15:28:31,040 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-09 15:28:31,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-09 15:28:31,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,052 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,062 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-09 15:28:31,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,064 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-09 15:28:31,065 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-09 15:28:31,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,089 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-09 15:28:31,090 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-09 15:28:31,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,114 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-09 15:28:31,115 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-09 15:28:31,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,142 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-09 15:28:31,143 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-09 15:28:31,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-09 15:28:31,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,164 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-09 15:28:31,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,166 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-09 15:28:31,167 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-09 15:28:31,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,193 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-09 15:28:31,193 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-09 15:28:31,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,219 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-09 15:28:31,219 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-09 15:28:31,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,243 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-09 15:28:31,244 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-09 15:28:31,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,268 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-09 15:28:31,269 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-09 15:28:31,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-11-09 15:28:31,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,299 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-09 15:28:31,299 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-09 15:28:31,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,311 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,320 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-09 15:28:31,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,322 INFO L229 MonitoredProcess]: Starting monitored process 75 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-09 15:28:31,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-09 15:28:31,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,345 INFO L229 MonitoredProcess]: Starting monitored process 76 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-09 15:28:31,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-09 15:28:31,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-09 15:28:31,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,369 INFO L229 MonitoredProcess]: Starting monitored process 77 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-09 15:28:31,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-09 15:28:31,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:31,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,393 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-09 15:28:31,394 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-09 15:28:31,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,416 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-09 15:28:31,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,417 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-09 15:28:31,418 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-09 15:28:31,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,440 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-09 15:28:31,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,441 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-09 15:28:31,442 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-09 15:28:31,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,460 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,474 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-09 15:28:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,476 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-09 15:28:31,477 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-09 15:28:31,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,501 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,514 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-09 15:28:31,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,516 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-09 15:28:31,517 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-09 15:28:31,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,540 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-09 15:28:31,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,542 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-09 15:28:31,543 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-09 15:28:31,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,565 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-09 15:28:31,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,567 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-09 15:28:31,568 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-09 15:28:31,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,591 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-09 15:28:31,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,593 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-09 15:28:31,594 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-09 15:28:31,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,616 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-09 15:28:31,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,617 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-09 15:28:31,618 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-09 15:28:31,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,631 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,641 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-09 15:28:31,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,643 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-09 15:28:31,644 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-09 15:28:31,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:31,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:31,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:31,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:31,656 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:31,665 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-09 15:28:31,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,667 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-09 15:28:31,668 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-09 15:28:31,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:31,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:31,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:31,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:31,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:31,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:31,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:31,693 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:31,718 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-09 15:28:31,718 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 22 variables to zero. [2024-11-09 15:28:31,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:31,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:31,719 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-09 15:28:31,720 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-09 15:28:31,721 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:31,732 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:31,732 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:31,732 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-09 15:28:31,744 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-09 15:28:31,748 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-09 15:28:31,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:31,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:31,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:31,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 15:28:31,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:31,897 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-09 15:28:31,897 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-09 15:28:31,898 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 23 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-09 15:28:32,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 23. 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 194 states and 262 transitions. Complement of second has 28 states. [2024-11-09 15:28:32,007 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-09 15:28:32,007 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-09 15:28:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2024-11-09 15:28:32,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 19 letters. Loop has 8 letters. [2024-11-09 15:28:32,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:32,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 27 letters. Loop has 8 letters. [2024-11-09 15:28:32,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:32,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 19 letters. Loop has 16 letters. [2024-11-09 15:28:32,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:32,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 262 transitions. [2024-11-09 15:28:32,012 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 48 [2024-11-09 15:28:32,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 181 states and 249 transitions. [2024-11-09 15:28:32,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2024-11-09 15:28:32,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2024-11-09 15:28:32,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 249 transitions. [2024-11-09 15:28:32,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:32,015 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 249 transitions. [2024-11-09 15:28:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 249 transitions. [2024-11-09 15:28:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2024-11-09 15:28:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 131 states have (on average 1.282442748091603) internal successors, (168), 132 states have internal predecessors, (168), 19 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) [2024-11-09 15:28:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 211 transitions. [2024-11-09 15:28:32,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 211 transitions. [2024-11-09 15:28:32,025 INFO L425 stractBuchiCegarLoop]: Abstraction has 161 states and 211 transitions. [2024-11-09 15:28:32,025 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:28:32,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 211 transitions. [2024-11-09 15:28:32,027 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 48 [2024-11-09 15:28:32,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:32,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:32,027 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-09 15:28:32,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:28:32,027 INFO L745 eck$LassoCheckResult]: Stem: 1260#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1215#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; 1216#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; 1219#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 1220#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1221#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 1222#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1285#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1259#L40-4 havoc main_~i~1#1; 1196#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1197#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1316#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); 1311#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1312#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1317#L24 assume ~n#1 < 2; 1315#merge_sortFINAL assume true; 1310#merge_sortEXIT >#88#return; 1304#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1305#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1309#L24 assume ~n#1 < 2; 1308#merge_sortFINAL assume true; 1303#merge_sortEXIT >#90#return; 1301#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; 1298#L11-3 [2024-11-09 15:28:32,028 INFO L747 eck$LassoCheckResult]: Loop: 1298#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1299#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 1302#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 1300#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1298#L11-3 [2024-11-09 15:28:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash 178168560, now seen corresponding path program 1 times [2024-11-09 15:28:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:32,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405769817] [2024-11-09 15:28:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:32,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2024-11-09 15:28:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:32,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956167133] [2024-11-09 15:28:32,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:32,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:32,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:32,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2084911979, now seen corresponding path program 1 times [2024-11-09 15:28:32,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:32,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148203276] [2024-11-09 15:28:32,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:32,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:32,110 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-09 15:28:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 15:28:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 15:28:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 15:28:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148203276] [2024-11-09 15:28:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148203276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:32,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:28:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929464053] [2024-11-09 15:28:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:28:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:28:32,248 INFO L87 Difference]: Start difference. First operand 161 states and 211 transitions. cyclomatic complexity: 68 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:28:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:32,308 INFO L93 Difference]: Finished difference Result 235 states and 314 transitions. [2024-11-09 15:28:32,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 314 transitions. [2024-11-09 15:28:32,310 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 82 [2024-11-09 15:28:32,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 235 states and 314 transitions. [2024-11-09 15:28:32,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2024-11-09 15:28:32,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2024-11-09 15:28:32,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 314 transitions. [2024-11-09 15:28:32,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:32,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 235 states and 314 transitions. [2024-11-09 15:28:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 314 transitions. [2024-11-09 15:28:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 197. [2024-11-09 15:28:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 167 states have (on average 1.2574850299401197) internal successors, (210), 168 states have internal predecessors, (210), 19 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) [2024-11-09 15:28:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 253 transitions. [2024-11-09 15:28:32,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 197 states and 253 transitions. [2024-11-09 15:28:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:28:32,333 INFO L425 stractBuchiCegarLoop]: Abstraction has 197 states and 253 transitions. [2024-11-09 15:28:32,333 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:28:32,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 253 transitions. [2024-11-09 15:28:32,334 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 72 [2024-11-09 15:28:32,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:32,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:32,334 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-09 15:28:32,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:32,335 INFO L745 eck$LassoCheckResult]: Stem: 1697#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1640#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; 1641#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; 1647#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 1648#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1649#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 1650#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1701#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1702#L40-4 havoc main_~i~1#1; 1612#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1613#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1737#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); 1733#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1734#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1738#L24 assume ~n#1 < 2; 1736#merge_sortFINAL assume true; 1732#merge_sortEXIT >#88#return; 1729#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1730#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1735#L24 assume ~n#1 < 2; 1731#merge_sortFINAL assume true; 1728#merge_sortEXIT >#90#return; 1727#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; 1721#L11-3 [2024-11-09 15:28:32,335 INFO L747 eck$LassoCheckResult]: Loop: 1721#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1722#L12 assume !(merge_~j~0#1 == merge_~n#1); 1746#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 1751#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 1752#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 1747#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 1739#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 1740#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1721#L11-3 [2024-11-09 15:28:32,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash 178168560, now seen corresponding path program 2 times [2024-11-09 15:28:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:32,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131774234] [2024-11-09 15:28:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2024-11-09 15:28:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505003983] [2024-11-09 15:28:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:32,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1066528190, now seen corresponding path program 1 times [2024-11-09 15:28:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:32,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676968057] [2024-11-09 15:28:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:32,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:33,500 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:33,500 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:33,500 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:33,500 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:33,500 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:33,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:33,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:33,501 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:33,501 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2024-11-09 15:28:33,501 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:33,501 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:33,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:33,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:34,326 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:34,327 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:34,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:34,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:34,328 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-09 15:28:34,329 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-09 15:28:34,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-09 15:28:34,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:34,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:34,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:34,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:34,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:34,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:34,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:34,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:34,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:34,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:34,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:34,352 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-09 15:28:34,353 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-09 15:28:34,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:34,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:34,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:34,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:34,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:34,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:34,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:34,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:34,378 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-09 15:28:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:34,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:34,379 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-09 15:28:34,380 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-09 15:28:34,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:34,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:34,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:34,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:34,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:34,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:34,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:34,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:34,411 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-09 15:28:34,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:34,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:34,413 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-09 15:28:34,413 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-09 15:28:34,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:34,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:34,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:34,424 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-09 15:28:34,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:34,469 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-11-09 15:28:34,469 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-09 15:28:34,724 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:34,955 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:28:34,956 INFO L444 ModelExtractionUtils]: 11 out of 100 variables were initially zero. Simplification set additionally 86 variables to zero. [2024-11-09 15:28:34,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:34,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:34,957 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-09 15:28:34,958 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-09 15:28:34,959 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:34,972 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2024-11-09 15:28:34,972 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:34,973 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~k~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~k~0#1 Supporting invariants [] [2024-11-09 15:28:34,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:35,002 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2024-11-09 15:28:35,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:28:35,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:35,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:35,285 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-09 15:28:35,285 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-09 15:28:35,286 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 197 states and 253 transitions. cyclomatic complexity: 74 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:28:35,405 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 197 states and 253 transitions. cyclomatic complexity: 74. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 415 states and 559 transitions. Complement of second has 10 states. [2024-11-09 15:28:35,409 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-09 15:28:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:28:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2024-11-09 15:28:35,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 23 letters. Loop has 8 letters. [2024-11-09 15:28:35,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:35,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 31 letters. Loop has 8 letters. [2024-11-09 15:28:35,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:35,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 23 letters. Loop has 16 letters. [2024-11-09 15:28:35,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:35,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415 states and 559 transitions. [2024-11-09 15:28:35,420 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 62 [2024-11-09 15:28:35,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415 states to 331 states and 449 transitions. [2024-11-09 15:28:35,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2024-11-09 15:28:35,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2024-11-09 15:28:35,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331 states and 449 transitions. [2024-11-09 15:28:35,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:35,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 331 states and 449 transitions. [2024-11-09 15:28:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states and 449 transitions. [2024-11-09 15:28:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 271. [2024-11-09 15:28:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 230 states have (on average 1.2826086956521738) internal successors, (295), 230 states have internal predecessors, (295), 26 states have call successors, (29), 18 states have call predecessors, (29), 15 states have return successors, (36), 22 states have call predecessors, (36), 24 states have call successors, (36) [2024-11-09 15:28:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 360 transitions. [2024-11-09 15:28:35,469 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 360 transitions. [2024-11-09 15:28:35,469 INFO L425 stractBuchiCegarLoop]: Abstraction has 271 states and 360 transitions. [2024-11-09 15:28:35,469 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:28:35,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 360 transitions. [2024-11-09 15:28:35,470 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 62 [2024-11-09 15:28:35,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:35,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:35,471 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-09 15:28:35,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:35,471 INFO L745 eck$LassoCheckResult]: Stem: 2470#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2413#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; 2414#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; 2419#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 2420#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2421#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 2422#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2477#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2466#L40-4 havoc main_~i~1#1; 2454#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2498#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2496#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); 2492#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2493#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2497#L24 assume ~n#1 < 2; 2495#merge_sortFINAL assume true; 2491#merge_sortEXIT >#88#return; 2488#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2489#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2494#L24 assume ~n#1 < 2; 2490#merge_sortFINAL assume true; 2487#merge_sortEXIT >#90#return; 2486#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; 2485#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 2482#L11-4 merge_~i~0#1 := 0; 2453#L17-3 [2024-11-09 15:28:35,472 INFO L747 eck$LassoCheckResult]: Loop: 2453#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 2455#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 2453#L17-3 [2024-11-09 15:28:35,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,472 INFO L85 PathProgramCache]: Analyzing trace with hash -578705235, now seen corresponding path program 1 times [2024-11-09 15:28:35,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424622554] [2024-11-09 15:28:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 15:28:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 15:28:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 15:28:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424622554] [2024-11-09 15:28:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424622554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:35,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:35,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:28:35,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64746614] [2024-11-09 15:28:35,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:35,617 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:35,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2024-11-09 15:28:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902356960] [2024-11-09 15:28:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:35,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:35,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:28:35,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:28:35,768 INFO L87 Difference]: Start difference. First operand 271 states and 360 transitions. cyclomatic complexity: 112 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-09 15:28:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:35,930 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2024-11-09 15:28:35,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 395 states and 516 transitions. [2024-11-09 15:28:35,940 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 64 [2024-11-09 15:28:35,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 395 states to 395 states and 516 transitions. [2024-11-09 15:28:35,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2024-11-09 15:28:35,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2024-11-09 15:28:35,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 395 states and 516 transitions. [2024-11-09 15:28:35,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:35,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 395 states and 516 transitions. [2024-11-09 15:28:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states and 516 transitions. [2024-11-09 15:28:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 282. [2024-11-09 15:28:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 238 states have (on average 1.2563025210084033) internal successors, (299), 241 states have internal predecessors, (299), 26 states have call successors, (29), 18 states have call predecessors, (29), 18 states have return successors, (42), 22 states have call predecessors, (42), 24 states have call successors, (42) [2024-11-09 15:28:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 370 transitions. [2024-11-09 15:28:35,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 282 states and 370 transitions. [2024-11-09 15:28:35,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:28:35,985 INFO L425 stractBuchiCegarLoop]: Abstraction has 282 states and 370 transitions. [2024-11-09 15:28:35,985 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:28:35,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 370 transitions. [2024-11-09 15:28:35,991 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 62 [2024-11-09 15:28:35,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:35,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:35,992 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:35,992 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:35,993 INFO L745 eck$LassoCheckResult]: Stem: 3157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3098#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; 3099#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; 3106#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 3107#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3108#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 3109#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3164#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 3110#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3111#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3156#L40-4 havoc main_~i~1#1; 3073#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3191#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3149#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); 3070#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3126#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3190#L24 assume ~n#1 < 2; 3199#merge_sortFINAL assume true; 3198#merge_sortEXIT >#88#return; 3074#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3141#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3189#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); 3104#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3260#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3261#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); 3082#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3280#$Ultimate##0 [2024-11-09 15:28:35,993 INFO L747 eck$LassoCheckResult]: Loop: 3280#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3282#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); 3085#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3280#$Ultimate##0 [2024-11-09 15:28:35,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:35,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1524308723, now seen corresponding path program 3 times [2024-11-09 15:28:35,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:35,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928562903] [2024-11-09 15:28:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:35,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:36,266 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-09 15:28:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:28:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:36,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928562903] [2024-11-09 15:28:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928562903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166672590] [2024-11-09 15:28:36,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:28:36,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:36,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:36,442 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:36,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2024-11-09 15:28:36,575 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 15:28:36,576 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:28:36,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:28:36,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:36,678 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-09 15:28:36,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:36,867 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-09 15:28:36,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166672590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:36,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:36,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 25 [2024-11-09 15:28:36,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371647085] [2024-11-09 15:28:36,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:36,867 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:36,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:36,868 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 4 times [2024-11-09 15:28:36,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:36,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418842991] [2024-11-09 15:28:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:36,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:36,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:36,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 15:28:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2024-11-09 15:28:37,018 INFO L87 Difference]: Start difference. First operand 282 states and 370 transitions. cyclomatic complexity: 111 Second operand has 25 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (10), 7 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-09 15:28:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:37,471 INFO L93 Difference]: Finished difference Result 493 states and 646 transitions. [2024-11-09 15:28:37,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 646 transitions. [2024-11-09 15:28:37,482 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 112 [2024-11-09 15:28:37,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 485 states and 637 transitions. [2024-11-09 15:28:37,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2024-11-09 15:28:37,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 292 [2024-11-09 15:28:37,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 637 transitions. [2024-11-09 15:28:37,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:37,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 485 states and 637 transitions. [2024-11-09 15:28:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 637 transitions. [2024-11-09 15:28:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 450. [2024-11-09 15:28:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 378 states have (on average 1.2486772486772486) internal successors, (472), 382 states have internal predecessors, (472), 42 states have call successors, (48), 32 states have call predecessors, (48), 30 states have return successors, (62), 35 states have call predecessors, (62), 38 states have call successors, (62) [2024-11-09 15:28:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 582 transitions. [2024-11-09 15:28:37,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 450 states and 582 transitions. [2024-11-09 15:28:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 15:28:37,518 INFO L425 stractBuchiCegarLoop]: Abstraction has 450 states and 582 transitions. [2024-11-09 15:28:37,518 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:28:37,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 582 transitions. [2024-11-09 15:28:37,520 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 108 [2024-11-09 15:28:37,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:37,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:37,520 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-09 15:28:37,520 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:37,520 INFO L745 eck$LassoCheckResult]: Stem: 4139#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4075#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; 4076#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; 4085#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 4086#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4087#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 4088#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4205#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4206#L40-4 havoc main_~i~1#1; 4051#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4052#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4472#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); 4103#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4104#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4480#L24 assume ~n#1 < 2; 4479#merge_sortFINAL assume true; 4478#merge_sortEXIT >#88#return; 4100#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4110#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4111#L24 assume ~n#1 < 2; 4099#merge_sortFINAL assume true; 4101#merge_sortEXIT >#90#return; 4092#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; 4093#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 4091#L12 assume !(merge_~j~0#1 == merge_~n#1); 4073#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 4058#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 4141#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 4144#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 4210#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 4209#L11-4 merge_~i~0#1 := 0; 4125#L17-3 [2024-11-09 15:28:37,521 INFO L747 eck$LassoCheckResult]: Loop: 4125#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 4126#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 4125#L17-3 [2024-11-09 15:28:37,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:37,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1013086271, now seen corresponding path program 1 times [2024-11-09 15:28:37,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:37,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134922063] [2024-11-09 15:28:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 15:28:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 15:28:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 15:28:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134922063] [2024-11-09 15:28:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134922063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:37,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:37,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 15:28:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693409578] [2024-11-09 15:28:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:37,764 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:37,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2024-11-09 15:28:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723489320] [2024-11-09 15:28:37,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:37,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:37,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:37,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 15:28:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 15:28:37,824 INFO L87 Difference]: Start difference. First operand 450 states and 582 transitions. cyclomatic complexity: 162 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-09 15:28:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:37,894 INFO L93 Difference]: Finished difference Result 571 states and 746 transitions. [2024-11-09 15:28:37,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 571 states and 746 transitions. [2024-11-09 15:28:37,904 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 146 [2024-11-09 15:28:37,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 571 states to 571 states and 746 transitions. [2024-11-09 15:28:37,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2024-11-09 15:28:37,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2024-11-09 15:28:37,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 571 states and 746 transitions. [2024-11-09 15:28:37,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:37,916 INFO L218 hiAutomatonCegarLoop]: Abstraction has 571 states and 746 transitions. [2024-11-09 15:28:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states and 746 transitions. [2024-11-09 15:28:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 548. [2024-11-09 15:28:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 476 states have (on average 1.2563025210084033) internal successors, (598), 480 states have internal predecessors, (598), 42 states have call successors, (48), 32 states have call predecessors, (48), 30 states have return successors, (62), 35 states have call predecessors, (62), 38 states have call successors, (62) [2024-11-09 15:28:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 708 transitions. [2024-11-09 15:28:37,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 548 states and 708 transitions. [2024-11-09 15:28:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:28:37,943 INFO L425 stractBuchiCegarLoop]: Abstraction has 548 states and 708 transitions. [2024-11-09 15:28:37,943 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 15:28:37,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 548 states and 708 transitions. [2024-11-09 15:28:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 144 [2024-11-09 15:28:37,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:37,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:37,946 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-09 15:28:37,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:37,946 INFO L745 eck$LassoCheckResult]: Stem: 5185#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5119#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; 5120#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; 5125#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 5126#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5127#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 5128#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5266#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 5184#L40-4 havoc main_~i~1#1; 5171#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5310#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5308#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); 5305#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5306#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5309#L24 assume ~n#1 < 2; 5307#merge_sortFINAL assume true; 5304#merge_sortEXIT >#88#return; 5302#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5303#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5313#L24 assume ~n#1 < 2; 5311#merge_sortFINAL assume true; 5312#merge_sortEXIT >#90#return; 5300#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; 5299#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 5298#L12 assume !(merge_~j~0#1 == merge_~n#1); 5296#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5294#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 5295#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 5284#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 5281#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 5282#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 5288#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 5272#L11-4 merge_~i~0#1 := 0; 5170#L17-3 [2024-11-09 15:28:37,946 INFO L747 eck$LassoCheckResult]: Loop: 5170#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 5172#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 5170#L17-3 [2024-11-09 15:28:37,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:37,950 INFO L85 PathProgramCache]: Analyzing trace with hash 956367225, now seen corresponding path program 1 times [2024-11-09 15:28:37,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645608806] [2024-11-09 15:28:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:38,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 15:28:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:38,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 15:28:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 15:28:38,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:38,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645608806] [2024-11-09 15:28:38,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645608806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:38,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48316547] [2024-11-09 15:28:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:38,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:38,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:38,102 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:38,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2024-11-09 15:28:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:38,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:38,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:38,200 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-09 15:28:38,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:38,237 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-09 15:28:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48316547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:38,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-09 15:28:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363239015] [2024-11-09 15:28:38,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:38,238 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:38,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2024-11-09 15:28:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:38,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270798619] [2024-11-09 15:28:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:38,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:38,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:38,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 15:28:38,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 15:28:38,301 INFO L87 Difference]: Start difference. First operand 548 states and 708 transitions. cyclomatic complexity: 190 Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:28:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:38,391 INFO L93 Difference]: Finished difference Result 955 states and 1186 transitions. [2024-11-09 15:28:38,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 955 states and 1186 transitions. [2024-11-09 15:28:38,409 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 146 [2024-11-09 15:28:38,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 955 states to 955 states and 1186 transitions. [2024-11-09 15:28:38,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 497 [2024-11-09 15:28:38,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 497 [2024-11-09 15:28:38,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 955 states and 1186 transitions. [2024-11-09 15:28:38,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:38,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 955 states and 1186 transitions. [2024-11-09 15:28:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states and 1186 transitions. [2024-11-09 15:28:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 716. [2024-11-09 15:28:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 644 states have (on average 1.2111801242236024) internal successors, (780), 648 states have internal predecessors, (780), 42 states have call successors, (48), 32 states have call predecessors, (48), 30 states have return successors, (62), 35 states have call predecessors, (62), 38 states have call successors, (62) [2024-11-09 15:28:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 890 transitions. [2024-11-09 15:28:38,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 716 states and 890 transitions. [2024-11-09 15:28:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 15:28:38,456 INFO L425 stractBuchiCegarLoop]: Abstraction has 716 states and 890 transitions. [2024-11-09 15:28:38,456 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 15:28:38,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 716 states and 890 transitions. [2024-11-09 15:28:38,462 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 144 [2024-11-09 15:28:38,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:38,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:38,466 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-09 15:28:38,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:38,467 INFO L745 eck$LassoCheckResult]: Stem: 6909#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6838#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; 6839#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; 6852#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 6853#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6854#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 6855#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6856#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6904#L40-4 havoc main_~i~1#1; 6891#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 7185#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7183#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); 7178#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7179#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7184#L24 assume ~n#1 < 2; 7182#merge_sortFINAL assume true; 7177#merge_sortEXIT >#88#return; 7172#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 7174#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7180#L24 assume ~n#1 < 2; 7175#merge_sortFINAL assume true; 7171#merge_sortEXIT >#90#return; 7170#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; 7169#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 7168#L12 assume !(merge_~j~0#1 == merge_~n#1); 7167#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 7165#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 7164#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 7163#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 7162#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 7161#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 7159#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 7158#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 7154#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 6961#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6962#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 6954#L11-4 merge_~i~0#1 := 0; 6890#L17-3 [2024-11-09 15:28:38,467 INFO L747 eck$LassoCheckResult]: Loop: 6890#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 6892#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 6890#L17-3 [2024-11-09 15:28:38,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -412481570, now seen corresponding path program 1 times [2024-11-09 15:28:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664558770] [2024-11-09 15:28:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:38,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:38,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:38,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2024-11-09 15:28:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:38,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617829879] [2024-11-09 15:28:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:38,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:38,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:38,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:38,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1257795936, now seen corresponding path program 1 times [2024-11-09 15:28:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576294657] [2024-11-09 15:28:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:38,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:38,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:38,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:40,282 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:40,282 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:40,282 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:40,282 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:40,282 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:40,282 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:40,282 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:40,282 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:40,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration13_Lasso [2024-11-09 15:28:40,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:40,282 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:40,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:40,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:41,335 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:41,335 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:41,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,338 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-09 15:28:41,339 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-09 15:28:41,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-09 15:28:41,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,363 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-09 15:28:41,363 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-09 15:28:41,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-09 15:28:41,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,377 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,388 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-09 15:28:41,389 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-09 15:28:41,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,412 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-09 15:28:41,413 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-09 15:28:41,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,437 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-09 15:28:41,438 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-09 15:28:41,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,450 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,463 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-09 15:28:41,464 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-09 15:28:41,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-09 15:28:41,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,487 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-09 15:28:41,488 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-09 15:28:41,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,510 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-09 15:28:41,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,512 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-09 15:28:41,513 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-09 15:28:41,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,540 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-09 15:28:41,540 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-09 15:28:41,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,564 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-09 15:28:41,565 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-09 15:28:41,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,588 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-09 15:28:41,589 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-09 15:28:41,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,614 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-09 15:28:41,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,615 INFO L229 MonitoredProcess]: Starting monitored process 108 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-09 15:28:41,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2024-11-09 15:28:41,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,642 INFO L229 MonitoredProcess]: Starting monitored process 109 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-09 15:28:41,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2024-11-09 15:28:41,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,654 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2024-11-09 15:28:41,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,667 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-09 15:28:41,668 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-09 15:28:41,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,698 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-09 15:28:41,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,701 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-09 15:28:41,702 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-09 15:28:41,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-09 15:28:41,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,726 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-09 15:28:41,727 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-09 15:28:41,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,753 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-09 15:28:41,754 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-09 15:28:41,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,777 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-09 15:28:41,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,779 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-09 15:28:41,780 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-09 15:28:41,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,803 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-09 15:28:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,805 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-09 15:28:41,806 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-09 15:28:41,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-09 15:28:41,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,829 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-09 15:28:41,830 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-09 15:28:41,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,852 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-09 15:28:41,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,854 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-09 15:28:41,854 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-09 15:28:41,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,867 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,877 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-09 15:28:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,879 INFO L229 MonitoredProcess]: Starting monitored process 118 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-09 15:28:41,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-09 15:28:41,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:41,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,903 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-09 15:28:41,904 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-09 15:28: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-09 15:28:41,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:41,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:41,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:41,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:41,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,928 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-09 15:28:41,928 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-09 15:28:41,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:41,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:41,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,952 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-09 15:28:41,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,954 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-09 15:28:41,955 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-09 15:28:41,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:41,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:41,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:41,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:41,980 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-09 15:28:41,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:41,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:41,982 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-09 15:28:41,983 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-09 15:28:41,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:41,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:41,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:41,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:41,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,041 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,056 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-09 15:28:42,057 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-09 15:28:42,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:42,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:42,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,082 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-09 15:28:42,083 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-09 15:28:42,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:42,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,112 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-09 15:28:42,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,114 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-09 15:28:42,115 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-09 15:28:42,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:42,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,145 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-09 15:28:42,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,147 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-09 15:28:42,147 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-09 15:28:42,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:42,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:42,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:42,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:42,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,170 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-09 15:28:42,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,171 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-09 15:28:42,175 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-09 15:28:42,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:42,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,202 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:42,213 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-09 15:28:42,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,215 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-09 15:28:42,217 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-09 15:28:42,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:42,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:42,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:42,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:42,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:42,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:42,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:42,246 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:42,270 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-09 15:28:42,270 INFO L444 ModelExtractionUtils]: 5 out of 31 variables were initially zero. Simplification set additionally 23 variables to zero. [2024-11-09 15:28:42,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:42,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:42,275 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-09 15:28:42,276 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-09 15:28:42,276 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:42,290 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:42,291 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:42,291 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~a#1.base)_2, merge_sort_merge_~i~0#1) = 1*v_rep(select #length merge_sort_merge_~a#1.base)_2 - 4*merge_sort_merge_~i~0#1 Supporting invariants [] [2024-11-09 15:28:42,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:42,339 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2024-11-09 15:28:42,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:28:42,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:28:42,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:42,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 15:28:42,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:42,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:42,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:42,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:42,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-09 15:28:42,630 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2024-11-09 15:28:42,630 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 716 states and 890 transitions. cyclomatic complexity: 204 Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-09 15:28:42,911 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 716 states and 890 transitions. cyclomatic complexity: 204. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 1065 states and 1348 transitions. Complement of second has 23 states. [2024-11-09 15:28:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 8 stem states 1 non-accepting loop states 2 accepting loop states [2024-11-09 15:28:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-09 15:28:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2024-11-09 15:28:42,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 37 letters. Loop has 2 letters. [2024-11-09 15:28:42,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:42,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 39 letters. Loop has 2 letters. [2024-11-09 15:28:42,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:42,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 37 letters. Loop has 4 letters. [2024-11-09 15:28:42,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:42,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1065 states and 1348 transitions. [2024-11-09 15:28:42,922 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 144 [2024-11-09 15:28:42,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1065 states to 895 states and 1132 transitions. [2024-11-09 15:28:42,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 398 [2024-11-09 15:28:42,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 408 [2024-11-09 15:28:42,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 895 states and 1132 transitions. [2024-11-09 15:28:42,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:42,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 895 states and 1132 transitions. [2024-11-09 15:28:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states and 1132 transitions. [2024-11-09 15:28:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 700. [2024-11-09 15:28:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 634 states have (on average 1.2160883280757098) internal successors, (771), 638 states have internal predecessors, (771), 40 states have call successors, (44), 27 states have call predecessors, (44), 26 states have return successors, (60), 34 states have call predecessors, (60), 37 states have call successors, (60) [2024-11-09 15:28:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 875 transitions. [2024-11-09 15:28:42,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 700 states and 875 transitions. [2024-11-09 15:28:42,942 INFO L425 stractBuchiCegarLoop]: Abstraction has 700 states and 875 transitions. [2024-11-09 15:28:42,942 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 15:28:42,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 700 states and 875 transitions. [2024-11-09 15:28:42,944 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 144 [2024-11-09 15:28:42,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:42,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:42,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:42,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:42,946 INFO L745 eck$LassoCheckResult]: Stem: 8932#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8862#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; 8863#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; 8868#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 8869#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8950#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 8952#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8870#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 8871#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8975#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 8974#L40-4 havoc main_~i~1#1; 8833#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 8834#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9213#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); 9208#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 9210#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9214#L24 assume ~n#1 < 2; 9211#merge_sortFINAL assume true; 9207#merge_sortEXIT >#88#return; 8846#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9206#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9205#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); 9192#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 9195#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9199#L24 assume ~n#1 < 2; 9197#merge_sortFINAL assume true; 9191#merge_sortEXIT >#88#return; 8918#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9318#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8917#L24 assume ~n#1 < 2; 8919#merge_sortFINAL assume true; 9480#merge_sortEXIT >#90#return; 9481#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; 8904#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8905#L12 assume !(merge_~j~0#1 == merge_~n#1); 8860#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 8861#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 9524#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 9529#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8935#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 8936#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8906#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 8907#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 8931#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 9489#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9490#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 9265#L11-4 merge_~i~0#1 := 0; 9260#L17-3 [2024-11-09 15:28:42,946 INFO L747 eck$LassoCheckResult]: Loop: 9260#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 9261#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 9260#L17-3 [2024-11-09 15:28:42,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash 107885914, now seen corresponding path program 2 times [2024-11-09 15:28:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:42,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7220479] [2024-11-09 15:28:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:42,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:42,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:42,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times [2024-11-09 15:28:42,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:42,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658398242] [2024-11-09 15:28:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:42,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:42,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:42,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:42,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 599149852, now seen corresponding path program 2 times [2024-11-09 15:28:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096404433] [2024-11-09 15:28:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:43,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:43,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:45,373 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:45,373 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:45,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:45,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:45,373 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:45,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:45,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:45,374 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:45,374 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration14_Lasso [2024-11-09 15:28:45,374 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:45,374 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:45,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:45,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,208 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:46,208 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:46,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,210 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-09 15:28:46,210 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-09 15:28:46,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-09 15:28:46,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,234 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-09 15:28:46,235 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-09 15:28:46,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-09 15:28:46,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,249 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,260 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-09 15:28:46,261 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-09 15:28:46,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,274 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,284 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-09 15:28:46,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,285 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-09 15:28:46,286 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-09 15:28:46,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,310 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-09 15:28:46,311 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-09 15:28:46,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-09 15:28:46,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,337 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-09 15:28:46,338 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-09 15:28:46,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,362 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-09 15:28:46,362 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-09 15:28:46,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,386 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-09 15:28:46,387 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-09 15:28:46,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,409 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-09 15:28:46,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,411 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-09 15:28:46,412 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-09 15:28:46,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,434 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-09 15:28:46,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,435 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-09 15:28:46,436 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-09 15:28:46,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,458 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-09 15:28:46,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,459 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-09 15:28:46,460 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-09 15:28:46,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,484 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-09 15:28:46,484 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-09 15:28:46,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,508 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-09 15:28:46,509 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-09 15:28:46,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,533 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-09 15:28:46,534 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-09 15:28:46,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,558 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-09 15:28:46,559 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-09 15:28:46,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,573 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,585 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-09 15:28:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,587 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-09 15:28:46,587 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-09 15:28:46,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,611 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-09 15:28:46,612 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-09 15:28:46,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,639 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-09 15:28:46,639 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-09 15:28:46,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,679 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-09 15:28:46,684 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-09 15:28:46,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,696 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,700 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,709 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-09 15:28:46,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,711 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-09 15:28:46,712 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-09 15:28:46,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,739 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-09 15:28:46,740 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-09 15:28:46,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-09 15:28:46,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,751 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-09 15:28:46,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,753 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-09 15:28:46,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,761 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,773 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-09 15:28:46,776 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-09 15:28:46,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-09 15:28:46,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,802 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-09 15:28:46,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,804 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-09 15:28:46,805 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-09 15:28:46,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-11-09 15:28:46,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,831 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-09 15:28:46,832 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-09 15:28:46,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:46,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,858 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-09 15:28:46,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,860 INFO L229 MonitoredProcess]: Starting monitored process 154 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-09 15:28:46,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2024-11-09 15:28:46,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-09 15:28:46,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,881 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,893 INFO L229 MonitoredProcess]: Starting monitored process 155 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-09 15:28:46,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2024-11-09 15:28:46,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2024-11-09 15:28:46,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,921 INFO L229 MonitoredProcess]: Starting monitored process 156 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-09 15:28:46,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2024-11-09 15:28:46,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,936 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2024-11-09 15:28:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,947 INFO L229 MonitoredProcess]: Starting monitored process 157 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-09 15:28:46,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2024-11-09 15:28:46,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:46,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:46,986 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-09 15:28:46,986 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-09 15:28:46,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,988 INFO L229 MonitoredProcess]: Starting monitored process 158 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-09 15:28:46,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2024-11-09 15:28:46,989 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:47,000 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-09 15:28:47,000 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:47,000 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~x~0#1.base)_3, merge_sort_merge_~i~0#1) = 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_3 - 4*merge_sort_merge_~i~0#1 Supporting invariants [1*merge_sort_merge_~x~0#1.offset >= 0] [2024-11-09 15:28:47,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2024-11-09 15:28:47,028 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-09 15:28:47,029 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:28:47,030 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:28:47,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 15:28:47,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:28:47,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:47,335 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-09 15:28:47,336 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-09 15:28:47,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 700 states and 875 transitions. cyclomatic complexity: 206 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:28:47,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 700 states and 875 transitions. cyclomatic complexity: 206. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 818 states and 1036 transitions. Complement of second has 8 states. [2024-11-09 15:28:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 15:28:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2024-11-09 15:28:47,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 47 letters. Loop has 2 letters. [2024-11-09 15:28:47,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 49 letters. Loop has 2 letters. [2024-11-09 15:28:47,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 47 letters. Loop has 4 letters. [2024-11-09 15:28:47,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 818 states and 1036 transitions. [2024-11-09 15:28:47,416 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 144 [2024-11-09 15:28:47,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 818 states to 810 states and 1022 transitions. [2024-11-09 15:28:47,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 384 [2024-11-09 15:28:47,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 389 [2024-11-09 15:28:47,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 810 states and 1022 transitions. [2024-11-09 15:28:47,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:47,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 810 states and 1022 transitions. [2024-11-09 15:28:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states and 1022 transitions. [2024-11-09 15:28:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 681. [2024-11-09 15:28:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 615 states have (on average 1.2227642276422763) internal successors, (752), 620 states have internal predecessors, (752), 40 states have call successors, (44), 27 states have call predecessors, (44), 26 states have return successors, (60), 33 states have call predecessors, (60), 37 states have call successors, (60) [2024-11-09 15:28:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 856 transitions. [2024-11-09 15:28:47,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 681 states and 856 transitions. [2024-11-09 15:28:47,445 INFO L425 stractBuchiCegarLoop]: Abstraction has 681 states and 856 transitions. [2024-11-09 15:28:47,445 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-09 15:28:47,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 681 states and 856 transitions. [2024-11-09 15:28:47,452 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 144 [2024-11-09 15:28:47,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:47,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:47,452 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-09 15:28:47,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:47,453 INFO L745 eck$LassoCheckResult]: Stem: 10667#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10601#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; 10602#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; 10609#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 10610#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10684#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 10687#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10611#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 10612#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10672#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 10673#L40-4 havoc main_~i~1#1; 10567#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 10568#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10987#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); 10979#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 10980#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10985#L24 assume ~n#1 < 2; 10986#merge_sortFINAL assume true; 10978#merge_sortEXIT >#88#return; 10588#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 10953#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11100#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); 10626#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 10627#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11168#L24 assume ~n#1 < 2; 11167#merge_sortFINAL assume true; 11165#merge_sortEXIT >#88#return; 10635#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 10634#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10636#L24 assume ~n#1 < 2; 11190#merge_sortFINAL assume true; 11191#merge_sortEXIT >#90#return; 11220#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; 11219#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 11218#L12 assume !(merge_~j~0#1 == merge_~n#1); 11217#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 11215#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 11212#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 11210#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 11208#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 11206#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 11204#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 11201#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 11106#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 11096#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 11097#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 10713#L11-4 merge_~i~0#1 := 0; 10714#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 10587#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 10589#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; 10959#merge_sortFINAL assume true; 10960#merge_sortEXIT >#90#return; 10951#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; 10950#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 10949#L12 assume !(merge_~j~0#1 == merge_~n#1); 10948#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 10946#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 10943#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 10941#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 10939#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 10937#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 10935#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 10932#L12 [2024-11-09 15:28:47,456 INFO L747 eck$LassoCheckResult]: Loop: 10932#L12 assume !(merge_~j~0#1 == merge_~n#1); 10934#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 10944#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 10945#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 10931#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 10925#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 10866#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 10867#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 10932#L12 [2024-11-09 15:28:47,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1365976563, now seen corresponding path program 1 times [2024-11-09 15:28:47,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042628363] [2024-11-09 15:28:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2024-11-09 15:28:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:28:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 15:28:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:28:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 15:28:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 15:28:47,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:47,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042628363] [2024-11-09 15:28:47,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042628363] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:47,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202133922] [2024-11-09 15:28:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:47,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,668 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-09 15:28:47,671 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-09 15:28:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 15:28:47,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:47,977 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-09 15:28:47,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:48,239 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-09 15:28:48,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202133922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:48,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:48,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 27 [2024-11-09 15:28:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5414032] [2024-11-09 15:28:48,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:48,240 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 1 times [2024-11-09 15:28:48,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:48,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339485757] [2024-11-09 15:28:48,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 15:28:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-09 15:28:48,394 INFO L87 Difference]: Start difference. First operand 681 states and 856 transitions. cyclomatic complexity: 209 Second operand has 27 states, 25 states have (on average 3.8) internal successors, (95), 22 states have internal predecessors, (95), 9 states have call successors, (13), 4 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-09 15:28:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:49,244 INFO L93 Difference]: Finished difference Result 1339 states and 1700 transitions. [2024-11-09 15:28:49,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1339 states and 1700 transitions. [2024-11-09 15:28:49,250 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 384 [2024-11-09 15:28:49,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1339 states to 1331 states and 1692 transitions. [2024-11-09 15:28:49,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2024-11-09 15:28:49,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 799 [2024-11-09 15:28:49,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1331 states and 1692 transitions. [2024-11-09 15:28:49,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:49,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1331 states and 1692 transitions. [2024-11-09 15:28:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states and 1692 transitions. [2024-11-09 15:28:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 877. [2024-11-09 15:28:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 800 states have (on average 1.21) internal successors, (968), 803 states have internal predecessors, (968), 49 states have call successors, (54), 29 states have call predecessors, (54), 28 states have return successors, (72), 44 states have call predecessors, (72), 46 states have call successors, (72) [2024-11-09 15:28:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1094 transitions. [2024-11-09 15:28:49,269 INFO L240 hiAutomatonCegarLoop]: Abstraction has 877 states and 1094 transitions. [2024-11-09 15:28:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-09 15:28:49,270 INFO L425 stractBuchiCegarLoop]: Abstraction has 877 states and 1094 transitions. [2024-11-09 15:28:49,270 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-09 15:28:49,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 877 states and 1094 transitions. [2024-11-09 15:28:49,272 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 188 [2024-11-09 15:28:49,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:49,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:49,273 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-09 15:28:49,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:49,273 INFO L745 eck$LassoCheckResult]: Stem: 13186#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13117#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; 13118#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; 13127#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 13128#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 13199#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 13201#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 13129#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 13130#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 13131#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 13194#L40-4 havoc main_~i~1#1; 13095#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 13096#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13345#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); 13318#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 13319#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13389#L24 assume ~n#1 < 2; 13386#merge_sortFINAL assume true; 13383#merge_sortEXIT >#88#return; 13154#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 13153#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13155#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); 13330#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 13337#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13360#L24 assume ~n#1 < 2; 13349#merge_sortFINAL assume true; 13329#merge_sortEXIT >#88#return; 13332#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 13623#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13625#L24 assume ~n#1 < 2; 13624#merge_sortFINAL assume true; 13621#merge_sortEXIT >#90#return; 13622#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; 13843#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13842#L12 assume !(merge_~j~0#1 == merge_~n#1); 13841#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13839#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 13838#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 13837#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13836#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 13835#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13834#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13830#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 13831#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 13858#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13857#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 13813#L11-4 merge_~i~0#1 := 0; 13812#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 13811#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 13809#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 13804#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 13803#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 13800#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 13798#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; 13795#merge_sortFINAL assume true; 13792#merge_sortEXIT >#90#return; 13137#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; 13138#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13962#L12 assume !(merge_~j~0#1 == merge_~n#1); 13961#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13959#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 13957#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 13958#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13953#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 13954#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13160#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13161#L12 [2024-11-09 15:28:49,274 INFO L747 eck$LassoCheckResult]: Loop: 13161#L12 assume !(merge_~j~0#1 == merge_~n#1); 13113#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13114#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 13097#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 13099#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13184#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 13176#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13177#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13161#L12 [2024-11-09 15:28:49,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash 875722351, now seen corresponding path program 1 times [2024-11-09 15:28:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327236258] [2024-11-09 15:28:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:49,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2024-11-09 15:28:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582545858] [2024-11-09 15:28:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:49,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash 817267747, now seen corresponding path program 2 times [2024-11-09 15:28:49,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:49,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033770950] [2024-11-09 15:28:49,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:54,581 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:54,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:54,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:54,582 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:54,582 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:54,582 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:54,582 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:54,582 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:54,582 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration16_Lasso [2024-11-09 15:28:54,582 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:54,582 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:54,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:54,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:54,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:54,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:54,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:54,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:54,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:55,958 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:55,958 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:55,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:55,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:55,960 INFO L229 MonitoredProcess]: Starting monitored process 160 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-09 15:28:55,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2024-11-09 15:28:55,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:55,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:55,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:55,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:55,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:55,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:55,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:55,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:55,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:55,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:55,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:55,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:55,986 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-09 15:28:55,987 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-09 15:28:55,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:55,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:55,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:55,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:55,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:55,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:55,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:55,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:55,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:56,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:56,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:56,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:56,010 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-09 15:28:56,011 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-09 15:28:56,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:56,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:56,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:56,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:56,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:56,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:56,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:56,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:56,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:56,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2024-11-09 15:28:56,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:56,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:56,055 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-09 15:28:56,056 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-09 15:28:56,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:56,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:56,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:56,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:56,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:56,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:56,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:56,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:56,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:56,078 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-09 15:28:56,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:56,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:56,080 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-09 15:28:56,080 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-09 15:28:56,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:56,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:56,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:56,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:56,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:56,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:56,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:56,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:56,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:56,105 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-09 15:28:56,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:56,106 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-09 15:28:56,107 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-09 15:28:56,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:56,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:56,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:56,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:56,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:56,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:56,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:56,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:56,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:56,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:56,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:56,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:56,131 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-09 15:28:56,132 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-09 15:28:56,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:28:56,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:56,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:56,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:56,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:56,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:56,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:56,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:56,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:56,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:56,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:56,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:56,155 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-09 15:28:56,156 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-09 15:28:56,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:28:56,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:56,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:56,167 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-09 15:28:56,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:56,214 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-11-09 15:28:56,214 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-09 15:28:56,413 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:57,435 INFO L443 ModelExtractionUtils]: Simplification made 78 calls to the SMT solver. [2024-11-09 15:28:57,435 INFO L444 ModelExtractionUtils]: 19 out of 100 variables were initially zero. Simplification set additionally 76 variables to zero. [2024-11-09 15:28:57,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:57,437 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-09 15:28:57,438 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-09 15:28:57,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:57,453 INFO L438 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2024-11-09 15:28:57,453 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:57,453 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_#in~a#1.base)_6, merge_sort_merge_~j~0#1) = 1*v_rep(select #length merge_sort_#in~a#1.base)_6 - 4*merge_sort_merge_~j~0#1 Supporting invariants [-1*merge_sort_merge_~i~0#1 >= 0] [2024-11-09 15:28:57,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:57,535 INFO L156 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2024-11-09 15:28:57,538 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:28:57,538 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:28:57,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:57,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:57,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 15:28:57,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:58,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:28:58,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:58,135 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-09 15:28:58,136 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2024-11-09 15:28:58,136 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 877 states and 1094 transitions. cyclomatic complexity: 259 Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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-09 15:28:58,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 877 states and 1094 transitions. cyclomatic complexity: 259. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 1148 states and 1411 transitions. Complement of second has 12 states. [2024-11-09 15:28:58,265 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-09 15:28:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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-09 15:28:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2024-11-09 15:28:58,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 66 letters. Loop has 8 letters. [2024-11-09 15:28:58,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:58,266 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:58,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:58,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 15:28:58,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:58,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:28:58,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:58,716 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-09 15:28:58,716 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-09 15:28:58,716 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 877 states and 1094 transitions. cyclomatic complexity: 259 Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-09 15:28:58,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 877 states and 1094 transitions. cyclomatic complexity: 259. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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 1157 states and 1411 transitions. Complement of second has 14 states. [2024-11-09 15:28:58,836 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-09 15:28:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-09 15:28:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2024-11-09 15:28:58,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 66 letters. Loop has 8 letters. [2024-11-09 15:28:58,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:58,837 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:28:58,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:58,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 15:28:58,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:59,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 15:28:59,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:59,274 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-09 15:28:59,275 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-09 15:28:59,275 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 877 states and 1094 transitions. cyclomatic complexity: 259 Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-09 15:28:59,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 877 states and 1094 transitions. cyclomatic complexity: 259. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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 1348 states and 1636 transitions. Complement of second has 23 states. [2024-11-09 15:28:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-09 15:28:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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-09 15:28:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2024-11-09 15:28:59,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 66 transitions. Stem has 66 letters. Loop has 8 letters. [2024-11-09 15:28:59,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:59,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 66 transitions. Stem has 74 letters. Loop has 8 letters. [2024-11-09 15:28:59,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:59,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 66 transitions. Stem has 66 letters. Loop has 16 letters. [2024-11-09 15:28:59,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:59,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1348 states and 1636 transitions. [2024-11-09 15:28:59,423 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 196 [2024-11-09 15:28:59,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1348 states to 1297 states and 1585 transitions. [2024-11-09 15:28:59,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2024-11-09 15:28:59,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 588 [2024-11-09 15:28:59,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1297 states and 1585 transitions. [2024-11-09 15:28:59,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:59,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1297 states and 1585 transitions. [2024-11-09 15:28:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states and 1585 transitions. [2024-11-09 15:28:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1166. [2024-11-09 15:28:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1089 states have (on average 1.216712580348944) internal successors, (1325), 1092 states have internal predecessors, (1325), 49 states have call successors, (54), 29 states have call predecessors, (54), 28 states have return successors, (72), 44 states have call predecessors, (72), 46 states have call successors, (72) [2024-11-09 15:28:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1451 transitions. [2024-11-09 15:28:59,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1166 states and 1451 transitions. [2024-11-09 15:28:59,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 1166 states and 1451 transitions. [2024-11-09 15:28:59,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-09 15:28:59,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1166 states and 1451 transitions. [2024-11-09 15:28:59,443 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 188 [2024-11-09 15:28:59,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:59,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:59,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:59,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:59,445 INFO L745 eck$LassoCheckResult]: Stem: 18603#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 18528#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; 18529#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; 18538#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 18539#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 18638#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 18639#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 18540#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 18541#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 18635#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 18636#L40-4 havoc main_~i~1#1; 18499#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 18500#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 18863#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); 18851#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 18858#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 18864#L24 assume ~n#1 < 2; 18859#merge_sortFINAL assume true; 18850#merge_sortEXIT >#88#return; 18754#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19329#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19327#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); 19318#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 19321#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19330#L24 assume ~n#1 < 2; 19323#merge_sortFINAL assume true; 19317#merge_sortEXIT >#88#return; 19312#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19315#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19322#L24 assume ~n#1 < 2; 19316#merge_sortFINAL assume true; 19311#merge_sortEXIT >#90#return; 19314#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; 19395#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 19393#L12 assume !(merge_~j~0#1 == merge_~n#1); 19392#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19391#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 19388#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 19386#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19384#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 19382#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19380#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 19374#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 19375#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 19410#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19409#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 18769#L11-4 merge_~i~0#1 := 0; 18770#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 18753#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 18755#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 18965#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 18966#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 18957#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 18958#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; 18941#merge_sortFINAL assume true; 18942#merge_sortEXIT >#90#return; 18798#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; 18797#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18795#L12 assume !(merge_~j~0#1 == merge_~n#1); 18796#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 18826#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 18825#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 18824#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 18823#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 18822#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 18821#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18766#L12 [2024-11-09 15:28:59,445 INFO L747 eck$LassoCheckResult]: Loop: 18766#L12 assume !(merge_~j~0#1 == merge_~n#1); 18820#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 18813#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 18789#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 18787#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 18785#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 18783#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 18765#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 18766#L12 [2024-11-09 15:28:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 932980653, now seen corresponding path program 1 times [2024-11-09 15:28:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155471574] [2024-11-09 15:28:59,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:59,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:59,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:59,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 2 times [2024-11-09 15:28:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408236236] [2024-11-09 15:28:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:59,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:59,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:59,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash -136591201, now seen corresponding path program 2 times [2024-11-09 15:28:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:59,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048598544] [2024-11-09 15:28:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:59,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:28:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 15:29:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:29:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 15:29:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 38 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 15:29:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048598544] [2024-11-09 15:29:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048598544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886904195] [2024-11-09 15:29:00,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:29:00,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:00,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:00,054 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:00,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2024-11-09 15:29:00,170 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:29:00,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:29:00,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 15:29:00,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 15:29:00,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:29:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 15:29:01,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886904195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:29:01,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:29:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 40 [2024-11-09 15:29:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703363575] [2024-11-09 15:29:01,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:29:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:29:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 15:29:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1411, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 15:29:01,246 INFO L87 Difference]: Start difference. First operand 1166 states and 1451 transitions. cyclomatic complexity: 344 Second operand has 40 states, 35 states have (on average 3.4) internal successors, (119), 29 states have internal predecessors, (119), 14 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 15:29:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:02,089 INFO L93 Difference]: Finished difference Result 1739 states and 2192 transitions. [2024-11-09 15:29:02,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1739 states and 2192 transitions. [2024-11-09 15:29:02,096 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 344 [2024-11-09 15:29:02,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1739 states to 1737 states and 2190 transitions. [2024-11-09 15:29:02,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 867 [2024-11-09 15:29:02,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 867 [2024-11-09 15:29:02,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1737 states and 2190 transitions. [2024-11-09 15:29:02,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:02,104 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1737 states and 2190 transitions. [2024-11-09 15:29:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states and 2190 transitions. [2024-11-09 15:29:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1291. [2024-11-09 15:29:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1216 states have (on average 1.2261513157894737) internal successors, (1491), 1216 states have internal predecessors, (1491), 47 states have call successors, (52), 31 states have call predecessors, (52), 28 states have return successors, (67), 43 states have call predecessors, (67), 44 states have call successors, (67) [2024-11-09 15:29:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1610 transitions. [2024-11-09 15:29:02,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1291 states and 1610 transitions. [2024-11-09 15:29:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 15:29:02,120 INFO L425 stractBuchiCegarLoop]: Abstraction has 1291 states and 1610 transitions. [2024-11-09 15:29:02,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-09 15:29:02,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1610 transitions. [2024-11-09 15:29:02,124 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 228 [2024-11-09 15:29:02,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:02,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:02,124 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-09 15:29:02,125 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:29:02,125 INFO L745 eck$LassoCheckResult]: Stem: 22088#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 22015#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; 22016#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; 22020#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 22021#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 22091#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 22092#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 22022#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 22023#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 22024#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 22089#L40-4 havoc main_~i~1#1; 21984#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 21985#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22306#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); 22270#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 22271#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22307#L24 assume ~n#1 < 2; 22288#merge_sortFINAL assume true; 22289#merge_sortEXIT >#88#return; 22043#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 22255#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22256#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); 22042#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 22044#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22389#L24 assume ~n#1 < 2; 22387#merge_sortFINAL assume true; 22381#merge_sortEXIT >#88#return; 22383#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 22576#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 22578#L24 assume ~n#1 < 2; 22577#merge_sortFINAL assume true; 22574#merge_sortEXIT >#90#return; 22575#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; 22952#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22950#L12 assume !(merge_~j~0#1 == merge_~n#1); 22951#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 22967#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 22965#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 22964#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 22963#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 22962#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22961#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22927#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 22928#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 22958#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22956#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 22687#L11-4 merge_~i~0#1 := 0; 22539#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 22538#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 22070#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 22071#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 22679#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 22670#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 22667#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; 22664#merge_sortFINAL assume true; 22661#merge_sortEXIT >#90#return; 22656#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; 22657#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22651#L12 assume !(merge_~j~0#1 == merge_~n#1); 22652#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 22647#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 22648#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 22638#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 22639#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 22630#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22631#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22719#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 22720#L12-2 [2024-11-09 15:29:02,125 INFO L747 eck$LassoCheckResult]: Loop: 22720#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 22734#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22733#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 22622#L12 assume !(merge_~j~0#1 == merge_~n#1); 22624#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 22735#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 22720#L12-2 [2024-11-09 15:29:02,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1377589123, now seen corresponding path program 3 times [2024-11-09 15:29:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:02,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385463135] [2024-11-09 15:29:02,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:29:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 15:29:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:29:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:02,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 15:29:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 15:29:02,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385463135] [2024-11-09 15:29:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385463135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897528385] [2024-11-09 15:29:02,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:29:02,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:02,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:02,384 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:02,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2024-11-09 15:29:02,509 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 15:29:02,509 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:29:02,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:29:02,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:02,656 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-09 15:29:02,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:29:02,763 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-09 15:29:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897528385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:29:02,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:29:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2024-11-09 15:29:02,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069983793] [2024-11-09 15:29:02,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:29:02,764 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:29:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1953713747, now seen corresponding path program 1 times [2024-11-09 15:29:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036343380] [2024-11-09 15:29:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:02,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:02,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:02,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:29:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 15:29:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-11-09 15:29:02,846 INFO L87 Difference]: Start difference. First operand 1291 states and 1610 transitions. cyclomatic complexity: 379 Second operand has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 20 states have internal predecessors, (87), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 15:29:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:03,388 INFO L93 Difference]: Finished difference Result 2329 states and 2918 transitions. [2024-11-09 15:29:03,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2329 states and 2918 transitions. [2024-11-09 15:29:03,397 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 532 [2024-11-09 15:29:03,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2329 states to 2245 states and 2808 transitions. [2024-11-09 15:29:03,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1196 [2024-11-09 15:29:03,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1196 [2024-11-09 15:29:03,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2245 states and 2808 transitions. [2024-11-09 15:29:03,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:03,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2245 states and 2808 transitions. [2024-11-09 15:29:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states and 2808 transitions. [2024-11-09 15:29:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1438. [2024-11-09 15:29:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1358 states have (on average 1.2179675994108983) internal successors, (1654), 1351 states have internal predecessors, (1654), 52 states have call successors, (57), 34 states have call predecessors, (57), 28 states have return successors, (73), 52 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-09 15:29:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1784 transitions. [2024-11-09 15:29:03,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1438 states and 1784 transitions. [2024-11-09 15:29:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 15:29:03,426 INFO L425 stractBuchiCegarLoop]: Abstraction has 1438 states and 1784 transitions. [2024-11-09 15:29:03,426 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-09 15:29:03,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1438 states and 1784 transitions. [2024-11-09 15:29:03,430 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 255 [2024-11-09 15:29:03,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:03,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:03,430 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-09 15:29:03,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:29:03,431 INFO L745 eck$LassoCheckResult]: Stem: 26186#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 26126#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; 26127#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; 26130#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 26131#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 26189#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 26190#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 26132#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 26133#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 26134#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 26187#L40-4 havoc main_~i~1#1; 26106#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 26107#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26344#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); 26291#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26292#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26327#L24 assume ~n#1 < 2; 26309#merge_sortFINAL assume true; 26310#merge_sortEXIT >#88#return; 26149#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26279#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26280#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); 26148#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26150#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26345#L24 assume ~n#1 < 2; 26341#merge_sortFINAL assume true; 26332#merge_sortEXIT >#88#return; 26334#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26530#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26532#L24 assume ~n#1 < 2; 26531#merge_sortFINAL assume true; 26528#merge_sortEXIT >#90#return; 26529#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; 26892#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 26890#L12 assume !(merge_~j~0#1 == merge_~n#1); 26889#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 26888#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 26886#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 26885#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 26884#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 26883#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26881#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 26882#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 26827#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 26822#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26823#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 26797#L11-4 merge_~i~0#1 := 0; 26795#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 26792#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26790#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 26788#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26787#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 26783#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 26781#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; 26779#merge_sortFINAL assume true; 26775#merge_sortEXIT >#90#return; 26768#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; 27476#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 27474#L12 assume !(merge_~j~0#1 == merge_~n#1); 27473#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 27472#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 27471#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 27470#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 27469#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 27468#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 27466#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 27467#L12 assume !(merge_~j~0#1 == merge_~n#1); 26122#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 26123#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 27478#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 27477#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 27465#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 26180#L11-4 merge_~i~0#1 := 0; 26165#L17-3 [2024-11-09 15:29:03,431 INFO L747 eck$LassoCheckResult]: Loop: 26165#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 26164#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26165#L17-3 [2024-11-09 15:29:03,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash 219246577, now seen corresponding path program 1 times [2024-11-09 15:29:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:03,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996631743] [2024-11-09 15:29:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:03,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:03,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:29:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 15:29:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:03,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:29:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 15:29:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:03,602 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-09 15:29:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996631743] [2024-11-09 15:29:03,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996631743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315240817] [2024-11-09 15:29:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:03,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:03,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:03,604 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:03,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2024-11-09 15:29:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:03,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:29:03,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:03,810 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-09 15:29:03,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:29:03,898 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-09 15:29:03,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315240817] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:29:03,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:29:03,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 17 [2024-11-09 15:29:03,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953037356] [2024-11-09 15:29:03,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:29:03,899 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:29:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 6 times [2024-11-09 15:29:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:03,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542025059] [2024-11-09 15:29:03,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:03,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:03,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:29:03,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 15:29:03,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-09 15:29:03,950 INFO L87 Difference]: Start difference. First operand 1438 states and 1784 transitions. cyclomatic complexity: 408 Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:29:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:04,147 INFO L93 Difference]: Finished difference Result 1639 states and 2017 transitions. [2024-11-09 15:29:04,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1639 states and 2017 transitions. [2024-11-09 15:29:04,152 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 290 [2024-11-09 15:29:04,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1639 states to 1639 states and 2017 transitions. [2024-11-09 15:29:04,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 882 [2024-11-09 15:29:04,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 882 [2024-11-09 15:29:04,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1639 states and 2017 transitions. [2024-11-09 15:29:04,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:04,158 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1639 states and 2017 transitions. [2024-11-09 15:29:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states and 2017 transitions. [2024-11-09 15:29:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1488. [2024-11-09 15:29:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1408 states have (on average 1.2137784090909092) internal successors, (1709), 1400 states have internal predecessors, (1709), 52 states have call successors, (57), 34 states have call predecessors, (57), 28 states have return successors, (73), 53 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-09 15:29:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1839 transitions. [2024-11-09 15:29:04,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1488 states and 1839 transitions. [2024-11-09 15:29:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 15:29:04,176 INFO L425 stractBuchiCegarLoop]: Abstraction has 1488 states and 1839 transitions. [2024-11-09 15:29:04,176 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-09 15:29:04,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1488 states and 1839 transitions. [2024-11-09 15:29:04,179 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 255 [2024-11-09 15:29:04,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:04,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:04,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 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, 1, 1] [2024-11-09 15:29:04,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:29:04,180 INFO L745 eck$LassoCheckResult]: Stem: 29794#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 29729#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; 29730#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; 29736#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 29737#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 29808#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 29812#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 29738#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 29739#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 29740#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 29791#L40-4 havoc main_~i~1#1; 29703#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 29704#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30133#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); 30092#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 30093#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30137#L24 assume ~n#1 < 2; 30113#merge_sortFINAL assume true; 30114#merge_sortEXIT >#88#return; 29754#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 30080#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30081#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); 29753#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 29755#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30214#L24 assume ~n#1 < 2; 30212#merge_sortFINAL assume true; 30208#merge_sortEXIT >#88#return; 30209#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 30333#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30335#L24 assume ~n#1 < 2; 30334#merge_sortFINAL assume true; 30331#merge_sortEXIT >#90#return; 30332#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; 30776#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30774#L12 assume !(merge_~j~0#1 == merge_~n#1); 30775#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 30793#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 30792#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 30790#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 30788#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 30786#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 30783#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30753#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 30749#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 30750#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 30566#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 30564#L11-4 merge_~i~0#1 := 0; 30563#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 30559#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 30557#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 30554#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 30553#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 30552#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 30551#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; 30550#merge_sortFINAL assume true; 30542#merge_sortEXIT >#90#return; 29748#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; 31041#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31042#L12 assume !(merge_~j~0#1 == merge_~n#1); 31065#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31066#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 31061#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 31062#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31057#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 31058#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31053#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31054#L12 assume !(merge_~j~0#1 == merge_~n#1); 31049#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 31050#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31111#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 31110#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31109#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 29741#L12 assume !(merge_~j~0#1 == merge_~n#1); 29725#L13 [2024-11-09 15:29:04,180 INFO L747 eck$LassoCheckResult]: Loop: 29725#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 29726#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31129#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 31115#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31116#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 31166#L12 assume !(merge_~j~0#1 == merge_~n#1); 29725#L13 [2024-11-09 15:29:04,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash 219246617, now seen corresponding path program 2 times [2024-11-09 15:29:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:04,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096279290] [2024-11-09 15:29:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:04,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:04,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1578483347, now seen corresponding path program 2 times [2024-11-09 15:29:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453976478] [2024-11-09 15:29:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:04,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:04,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:04,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1239989419, now seen corresponding path program 3 times [2024-11-09 15:29:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:04,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030393997] [2024-11-09 15:29:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:04,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:04,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 15:29:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:04,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 15:29:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:29:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 15:29:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 52 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 15:29:04,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:04,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030393997] [2024-11-09 15:29:04,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030393997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:04,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105278927] [2024-11-09 15:29:04,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:29:04,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:04,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:04,539 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:04,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2024-11-09 15:29:04,703 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 15:29:04,704 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:29:04,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 15:29:04,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 15:29:04,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:29:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 15:29:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105278927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:29:04,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:29:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 20 [2024-11-09 15:29:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671439633] [2024-11-09 15:29:04,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:29:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:29:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 15:29:05,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 15:29:05,033 INFO L87 Difference]: Start difference. First operand 1488 states and 1839 transitions. cyclomatic complexity: 413 Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 18 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 15:29:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:05,250 INFO L93 Difference]: Finished difference Result 1561 states and 1917 transitions. [2024-11-09 15:29:05,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1561 states and 1917 transitions. [2024-11-09 15:29:05,256 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 257 [2024-11-09 15:29:05,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1561 states to 1557 states and 1913 transitions. [2024-11-09 15:29:05,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 814 [2024-11-09 15:29:05,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 833 [2024-11-09 15:29:05,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1557 states and 1913 transitions. [2024-11-09 15:29:05,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:05,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1557 states and 1913 transitions. [2024-11-09 15:29:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states and 1913 transitions. [2024-11-09 15:29:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1544. [2024-11-09 15:29:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1464 states have (on average 1.2083333333333333) internal successors, (1769), 1455 states have internal predecessors, (1769), 52 states have call successors, (57), 34 states have call predecessors, (57), 28 states have return successors, (73), 54 states have call predecessors, (73), 49 states have call successors, (73) [2024-11-09 15:29:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1899 transitions. [2024-11-09 15:29:05,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1544 states and 1899 transitions. [2024-11-09 15:29:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 15:29:05,292 INFO L425 stractBuchiCegarLoop]: Abstraction has 1544 states and 1899 transitions. [2024-11-09 15:29:05,292 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-09 15:29:05,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1544 states and 1899 transitions. [2024-11-09 15:29:05,296 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 255 [2024-11-09 15:29:05,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:05,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:05,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 4, 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-09 15:29:05,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:29:05,297 INFO L745 eck$LassoCheckResult]: Stem: 33419#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33344#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; 33345#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; 33351#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 33352#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 33438#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 33442#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 33353#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 33354#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 33355#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 33433#L40-4 havoc main_~i~1#1; 33310#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 33311#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33740#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); 33736#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33737#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33742#L24 assume ~n#1 < 2; 33739#merge_sortFINAL assume true; 33735#merge_sortEXIT >#88#return; 33732#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 33733#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33915#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); 33904#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 33906#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33911#L24 assume ~n#1 < 2; 33908#merge_sortFINAL assume true; 33901#merge_sortEXIT >#88#return; 33896#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 33899#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 33907#L24 assume ~n#1 < 2; 33900#merge_sortFINAL assume true; 33895#merge_sortEXIT >#90#return; 33898#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; 33967#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33965#L12 assume !(merge_~j~0#1 == merge_~n#1); 33964#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 33962#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 33959#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 33957#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 33955#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 33953#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 33951#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33952#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 33948#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 33980#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 33977#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 33748#L11-4 merge_~i~0#1 := 0; 33747#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 33746#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 33745#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 33744#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 33743#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 33741#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 33738#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; 33734#merge_sortFINAL assume true; 33731#merge_sortEXIT >#90#return; 33730#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; 33729#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33727#L12 assume !(merge_~j~0#1 == merge_~n#1); 33728#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 34172#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 34171#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 34169#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 34167#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 34165#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 34163#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 34161#L12 assume !(merge_~j~0#1 == merge_~n#1); 34159#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 34157#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 34156#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 34155#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 34154#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 34153#L12 assume !(merge_~j~0#1 == merge_~n#1); 34152#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 33701#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 33700#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 33699#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 33534#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 33517#L11-4 merge_~i~0#1 := 0; 33516#L17-3 [2024-11-09 15:29:05,297 INFO L747 eck$LassoCheckResult]: Loop: 33516#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 33515#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 33516#L17-3 [2024-11-09 15:29:05,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1239989379, now seen corresponding path program 4 times [2024-11-09 15:29:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:05,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102740465] [2024-11-09 15:29:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:05,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:05,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:05,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 7 times [2024-11-09 15:29:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:05,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337088168] [2024-11-09 15:29:05,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:05,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:05,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:05,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:05,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1923853829, now seen corresponding path program 5 times [2024-11-09 15:29:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914649803] [2024-11-09 15:29:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:05,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:05,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:15,568 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:29:15,568 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:29:15,568 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:29:15,568 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:29:15,568 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:29:15,568 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:15,569 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:29:15,569 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:29:15,569 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration21_Lasso [2024-11-09 15:29:15,569 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:29:15,569 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:29:15,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:15,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:16,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:17,071 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:29:17,071 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:29:17,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:17,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:17,075 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-09 15:29:17,080 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-09 15:29:17,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:17,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:17,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:17,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:17,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:17,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:17,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:17,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:17,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:17,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:17,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:17,112 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-09 15:29:17,113 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-09 15:29:17,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:17,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:17,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:17,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:17,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:17,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:29:17,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:29:17,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:17,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2024-11-09 15:29:17,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:17,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:17,153 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-09 15:29:17,154 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-09 15:29:17,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:17,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:17,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:17,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:17,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:17,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:29:17,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:29:17,180 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:29:17,193 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:29:17,193 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-11-09 15:29:17,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:17,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:17,195 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-09 15:29:17,196 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-09 15:29:17,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:29:17,207 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:29:17,207 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:29:17,207 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-09 15:29:17,218 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-09 15:29:17,253 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2024-11-09 15:29:17,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:17,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:29:17,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:17,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:29:17,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:17,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-09 15:29:17,551 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-09 15:29:17,551 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 1899 transitions. cyclomatic complexity: 417 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-09 15:29:17,587 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 1899 transitions. cyclomatic complexity: 417. 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 1690 states and 2091 transitions. Complement of second has 7 states. [2024-11-09 15:29:17,588 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-09 15:29:17,588 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-09 15:29:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-09 15:29:17,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 79 letters. Loop has 2 letters. [2024-11-09 15:29:17,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:29:17,590 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:29:17,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:17,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:29:17,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:17,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:29:17,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:29:17,892 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-09 15:29:17,892 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 1899 transitions. cyclomatic complexity: 417 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-09 15:29:17,924 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 1899 transitions. cyclomatic complexity: 417. 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 1690 states and 2091 transitions. Complement of second has 7 states. [2024-11-09 15:29:17,925 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-09 15:29:17,925 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-09 15:29:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2024-11-09 15:29:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 79 letters. Loop has 2 letters. [2024-11-09 15:29:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:29:17,925 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 15:29:17,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:18,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:29:18,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:18,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2024-11-09 15:29:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:18,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:29:18,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:18,280 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-09 15:29:18,280 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-09 15:29:18,280 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1544 states and 1899 transitions. cyclomatic complexity: 417 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-09 15:29:18,311 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1544 states and 1899 transitions. cyclomatic complexity: 417. 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 1648 states and 2037 transitions. Complement of second has 9 states. [2024-11-09 15:29:18,312 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-09 15:29:18,312 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-09 15:29:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2024-11-09 15:29:18,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 79 letters. Loop has 2 letters. [2024-11-09 15:29:18,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:29:18,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 81 letters. Loop has 2 letters. [2024-11-09 15:29:18,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:29:18,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 79 letters. Loop has 4 letters. [2024-11-09 15:29:18,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:29:18,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1648 states and 2037 transitions. [2024-11-09 15:29:18,318 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 274 [2024-11-09 15:29:18,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1648 states to 1482 states and 1816 transitions. [2024-11-09 15:29:18,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 785 [2024-11-09 15:29:18,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 791 [2024-11-09 15:29:18,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1482 states and 1816 transitions. [2024-11-09 15:29:18,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:18,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1482 states and 1816 transitions. [2024-11-09 15:29:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states and 1816 transitions. [2024-11-09 15:29:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1311. [2024-11-09 15:29:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1238 states have (on average 1.2140549273021002) internal successors, (1503), 1230 states have internal predecessors, (1503), 47 states have call successors, (52), 31 states have call predecessors, (52), 26 states have return successors, (69), 49 states have call predecessors, (69), 45 states have call successors, (69) [2024-11-09 15:29:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1624 transitions. [2024-11-09 15:29:18,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1311 states and 1624 transitions. [2024-11-09 15:29:18,337 INFO L425 stractBuchiCegarLoop]: Abstraction has 1311 states and 1624 transitions. [2024-11-09 15:29:18,337 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-09 15:29:18,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1311 states and 1624 transitions. [2024-11-09 15:29:18,340 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 241 [2024-11-09 15:29:18,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:18,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:18,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2024-11-09 15:29:18,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:29:18,341 INFO L745 eck$LassoCheckResult]: Stem: 40795#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40731#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; 40732#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; 40739#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 40740#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 40811#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 40809#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 40810#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 40812#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 40741#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 40742#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 40804#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 40805#L40-4 havoc main_~i~1#1; 40706#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 40707#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40852#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); 40836#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 40839#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40842#L24 assume ~n#1 < 2; 40840#merge_sortFINAL assume true; 40835#merge_sortEXIT >#88#return; 40753#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41120#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41117#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); 41111#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41114#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41118#L24 assume ~n#1 < 2; 41116#merge_sortFINAL assume true; 41110#merge_sortEXIT >#88#return; 41097#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41125#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41108#L24 assume ~n#1 < 2; 41109#merge_sortFINAL assume true; 41096#merge_sortEXIT >#90#return; 41098#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; 41625#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41623#L12 assume !(merge_~j~0#1 == merge_~n#1); 41622#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41621#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 41619#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 41620#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41635#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 41634#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41633#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40961#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 41068#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 41138#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41132#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 40958#L11-4 merge_~i~0#1 := 0; 40887#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 40888#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 40780#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 40781#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 41600#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41598#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41596#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; 41595#merge_sortFINAL assume true; 40752#merge_sortEXIT >#90#return; 40754#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; 41963#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41961#L12 assume !(merge_~j~0#1 == merge_~n#1); 41962#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 42004#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 42003#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 42002#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 42001#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 42000#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41999#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41998#L12 assume !(merge_~j~0#1 == merge_~n#1); 40727#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 40728#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41941#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 41940#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 40772#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40745#L12 assume !(merge_~j~0#1 == merge_~n#1); 40746#L13 [2024-11-09 15:29:18,341 INFO L747 eck$LassoCheckResult]: Loop: 40746#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 41996#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41943#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 41993#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41991#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 41984#L12 assume !(merge_~j~0#1 == merge_~n#1); 40746#L13 [2024-11-09 15:29:18,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1481015301, now seen corresponding path program 6 times [2024-11-09 15:29:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807557304] [2024-11-09 15:29:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:18,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:18,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 15:29:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 15:29:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:18,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:29:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 15:29:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 15:29:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807557304] [2024-11-09 15:29:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807557304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496761412] [2024-11-09 15:29:18,621 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 15:29:18,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:18,622 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:18,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2024-11-09 15:29:18,806 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-09 15:29:18,806 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:29:18,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 15:29:18,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 43 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 15:29:18,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:29:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 43 proven. 34 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 15:29:19,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496761412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:29:19,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:29:19,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 27 [2024-11-09 15:29:19,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15195730] [2024-11-09 15:29:19,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:29:19,197 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:29:19,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1578483347, now seen corresponding path program 3 times [2024-11-09 15:29:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:19,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385511452] [2024-11-09 15:29:19,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:19,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:19,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:19,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:29:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 15:29:19,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2024-11-09 15:29:19,275 INFO L87 Difference]: Start difference. First operand 1311 states and 1624 transitions. cyclomatic complexity: 366 Second operand has 27 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 21 states have internal predecessors, (88), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 15:29:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:19,698 INFO L93 Difference]: Finished difference Result 3416 states and 4146 transitions. [2024-11-09 15:29:19,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3416 states and 4146 transitions. [2024-11-09 15:29:19,707 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 374 [2024-11-09 15:29:19,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3416 states to 3128 states and 3783 transitions. [2024-11-09 15:29:19,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1652 [2024-11-09 15:29:19,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1652 [2024-11-09 15:29:19,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3128 states and 3783 transitions. [2024-11-09 15:29:19,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:19,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3128 states and 3783 transitions. [2024-11-09 15:29:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states and 3783 transitions. [2024-11-09 15:29:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 1261. [2024-11-09 15:29:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1191 states have (on average 1.2040302267002518) internal successors, (1434), 1186 states have internal predecessors, (1434), 45 states have call successors, (48), 29 states have call predecessors, (48), 25 states have return successors, (65), 45 states have call predecessors, (65), 43 states have call successors, (65) [2024-11-09 15:29:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1547 transitions. [2024-11-09 15:29:19,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1261 states and 1547 transitions. [2024-11-09 15:29:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 15:29:19,743 INFO L425 stractBuchiCegarLoop]: Abstraction has 1261 states and 1547 transitions. [2024-11-09 15:29:19,743 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-09 15:29:19,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1261 states and 1547 transitions. [2024-11-09 15:29:19,745 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 241 [2024-11-09 15:29:19,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:19,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:19,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:19,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:29:19,746 INFO L745 eck$LassoCheckResult]: Stem: 46075#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 46016#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; 46017#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; 46021#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 46022#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 46083#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 46081#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 46082#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 46084#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 46023#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 46024#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 46128#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 46074#L40-4 havoc main_~i~1#1; 45996#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 46127#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46125#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); 46115#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46119#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46122#L24 assume ~n#1 < 2; 46120#merge_sortFINAL assume true; 46117#merge_sortEXIT >#88#return; 46118#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46179#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46176#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); 46153#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46154#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46200#L24 assume ~n#1 < 2; 46199#merge_sortFINAL assume true; 46198#merge_sortEXIT >#88#return; 46137#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46192#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46190#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); 46162#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 46165#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46182#L24 assume ~n#1 < 2; 46181#merge_sortFINAL assume true; 46161#merge_sortEXIT >#88#return; 46163#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 46378#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 46380#L24 assume ~n#1 < 2; 46379#merge_sortFINAL assume true; 46377#merge_sortEXIT >#90#return; 46376#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; 46375#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46373#L12 assume !(merge_~j~0#1 == merge_~n#1); 46372#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46371#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 46369#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 46368#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46367#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 46366#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 46365#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46364#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 46360#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 46402#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 46401#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 46138#L11-4 merge_~i~0#1 := 0; 46438#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 46437#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 46436#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 46430#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 46427#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; 46424#merge_sortFINAL assume true; 46419#merge_sortEXIT >#90#return; 46421#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; 46528#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46526#L12 assume !(merge_~j~0#1 == merge_~n#1); 46527#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46569#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 46568#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 46567#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46566#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 46565#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 46564#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46563#L12 assume !(merge_~j~0#1 == merge_~n#1); 46561#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 46560#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46559#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 46558#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 46556#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46545#L12 assume !(merge_~j~0#1 == merge_~n#1); 46535#L13 [2024-11-09 15:29:19,746 INFO L747 eck$LassoCheckResult]: Loop: 46535#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 46536#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46552#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 46547#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 46546#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46544#L12 assume !(merge_~j~0#1 == merge_~n#1); 46535#L13 [2024-11-09 15:29:19,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1926564179, now seen corresponding path program 7 times [2024-11-09 15:29:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744685814] [2024-11-09 15:29:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:19,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 15:29:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:19,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 15:29:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 15:29:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:20,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:29:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 15:29:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 39 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 15:29:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744685814] [2024-11-09 15:29:20,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744685814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524059989] [2024-11-09 15:29:20,009 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 15:29:20,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:20,011 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:20,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2024-11-09 15:29:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:20,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 15:29:20,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 44 proven. 49 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 15:29:20,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:29:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 15:29:20,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524059989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:29:20,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:29:20,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 28 [2024-11-09 15:29:20,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295213425] [2024-11-09 15:29:20,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:29:20,620 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:29:20,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1578483347, now seen corresponding path program 4 times [2024-11-09 15:29:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:20,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482158244] [2024-11-09 15:29:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:20,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:20,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:29:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 15:29:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2024-11-09 15:29:20,709 INFO L87 Difference]: Start difference. First operand 1261 states and 1547 transitions. cyclomatic complexity: 335 Second operand has 28 states, 23 states have (on average 4.173913043478261) internal successors, (96), 21 states have internal predecessors, (96), 12 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 8 states have call predecessors, (15), 9 states have call successors, (15) [2024-11-09 15:29:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:21,159 INFO L93 Difference]: Finished difference Result 1467 states and 1843 transitions. [2024-11-09 15:29:21,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1467 states and 1843 transitions. [2024-11-09 15:29:21,164 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 320 [2024-11-09 15:29:21,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1467 states to 1463 states and 1839 transitions. [2024-11-09 15:29:21,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 858 [2024-11-09 15:29:21,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 858 [2024-11-09 15:29:21,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1463 states and 1839 transitions. [2024-11-09 15:29:21,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:21,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1463 states and 1839 transitions. [2024-11-09 15:29:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states and 1839 transitions. [2024-11-09 15:29:21,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 902. [2024-11-09 15:29:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 844 states have (on average 1.2132701421800949) internal successors, (1024), 843 states have internal predecessors, (1024), 37 states have call successors, (40), 22 states have call predecessors, (40), 21 states have return successors, (62), 36 states have call predecessors, (62), 35 states have call successors, (62) [2024-11-09 15:29:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1126 transitions. [2024-11-09 15:29:21,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 902 states and 1126 transitions. [2024-11-09 15:29:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 15:29:21,183 INFO L425 stractBuchiCegarLoop]: Abstraction has 902 states and 1126 transitions. [2024-11-09 15:29:21,184 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-09 15:29:21,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 902 states and 1126 transitions. [2024-11-09 15:29:21,185 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 175 [2024-11-09 15:29:21,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:21,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:21,186 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:21,186 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:29:21,186 INFO L745 eck$LassoCheckResult]: Stem: 49402#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 49334#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; 49335#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; 49338#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 49339#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49440#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 49438#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49439#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 49441#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49340#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 49341#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49405#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 49399#L40-4 havoc main_~i~1#1; 49310#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 49311#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49386#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); 49368#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49360#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49370#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); 49369#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49360#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49371#L24 assume ~n#1 < 2; 49437#merge_sortFINAL assume true; 49436#merge_sortEXIT >#88#return; 49378#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 49430#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49431#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); 49316#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49428#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49500#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); 49357#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49358#$Ultimate##0 [2024-11-09 15:29:21,186 INFO L747 eck$LassoCheckResult]: Loop: 49358#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49367#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); 49366#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49358#$Ultimate##0 [2024-11-09 15:29:21,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1652352750, now seen corresponding path program 4 times [2024-11-09 15:29:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497506933] [2024-11-09 15:29:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 15:29:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:29:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497506933] [2024-11-09 15:29:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497506933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142444103] [2024-11-09 15:29:21,387 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:29:21,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:21,389 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:21,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2024-11-09 15:29:21,507 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:29:21,507 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:29:21,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:29:21,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:21,573 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-09 15:29:21,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:29:21,697 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-09 15:29:21,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142444103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:29:21,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:29:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 26 [2024-11-09 15:29:21,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204447070] [2024-11-09 15:29:21,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:29:21,698 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:29:21,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash 30002, now seen corresponding path program 5 times [2024-11-09 15:29:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:21,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130329130] [2024-11-09 15:29:21,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:21,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:21,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:29:21,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 15:29:21,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-11-09 15:29:21,813 INFO L87 Difference]: Start difference. First operand 902 states and 1126 transitions. cyclomatic complexity: 262 Second operand has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 10 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 15:29:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:22,338 INFO L93 Difference]: Finished difference Result 890 states and 1119 transitions. [2024-11-09 15:29:22,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 890 states and 1119 transitions. [2024-11-09 15:29:22,341 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 279 [2024-11-09 15:29:22,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 890 states to 881 states and 1108 transitions. [2024-11-09 15:29:22,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 671 [2024-11-09 15:29:22,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 680 [2024-11-09 15:29:22,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 881 states and 1108 transitions. [2024-11-09 15:29:22,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:22,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 881 states and 1108 transitions. [2024-11-09 15:29:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states and 1108 transitions. [2024-11-09 15:29:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 705. [2024-11-09 15:29:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 660 states have (on average 1.2136363636363636) internal successors, (801), 662 states have internal predecessors, (801), 29 states have call successors, (30), 20 states have call predecessors, (30), 16 states have return successors, (59), 22 states have call predecessors, (59), 26 states have call successors, (59) [2024-11-09 15:29:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 890 transitions. [2024-11-09 15:29:22,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 705 states and 890 transitions. [2024-11-09 15:29:22,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 15:29:22,359 INFO L425 stractBuchiCegarLoop]: Abstraction has 705 states and 890 transitions. [2024-11-09 15:29:22,359 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-09 15:29:22,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 705 states and 890 transitions. [2024-11-09 15:29:22,360 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 213 [2024-11-09 15:29:22,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:22,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:22,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:22,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:22,361 INFO L745 eck$LassoCheckResult]: Stem: 51428#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51376#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; 51377#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; 51382#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 51383#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 51384#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 51385#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 51386#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 51443#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 51442#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 51441#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 51439#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 51438#L40-4 havoc main_~i~1#1; 51355#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 51356#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51529#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); 51450#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 51528#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51525#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); 51519#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 51521#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51406#L24 assume ~n#1 < 2; 51523#merge_sortFINAL assume true; 51518#merge_sortEXIT >#88#return; 51512#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 51515#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51514#L24 assume ~n#1 < 2; 51511#merge_sortFINAL assume true; 51513#merge_sortEXIT >#90#return; 51483#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; 51482#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51480#L12 assume !(merge_~j~0#1 == merge_~n#1); 51481#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51510#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 51509#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 51506#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51503#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 51499#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 51495#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51493#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 51459#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 51502#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 51498#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 51451#L11-4 merge_~i~0#1 := 0; 51564#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 51563#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 51561#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 51562#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 51567#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 51565#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 51552#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; 51549#merge_sortFINAL assume true; 51544#merge_sortEXIT >#88#return; 51379#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 51583#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51582#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); 51396#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 51397#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51404#L24 assume ~n#1 < 2; 51581#merge_sortFINAL assume true; 51579#merge_sortEXIT >#88#return; 51413#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 51414#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 51417#L24 assume ~n#1 < 2; 51418#merge_sortFINAL assume true; 51712#merge_sortEXIT >#90#return; 51713#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; 51767#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51765#L12 assume !(merge_~j~0#1 == merge_~n#1); 51766#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51795#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 51794#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 51793#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51792#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 51791#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 51789#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51730#L12 [2024-11-09 15:29:22,361 INFO L747 eck$LassoCheckResult]: Loop: 51730#L12 assume !(merge_~j~0#1 == merge_~n#1); 51774#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51768#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 51759#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 51757#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51755#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 51753#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 51729#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51730#L12 [2024-11-09 15:29:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:22,362 INFO L85 PathProgramCache]: Analyzing trace with hash -34905995, now seen corresponding path program 3 times [2024-11-09 15:29:22,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:22,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568688840] [2024-11-09 15:29:22,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:22,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:22,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:22,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 3 times [2024-11-09 15:29:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:22,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213266945] [2024-11-09 15:29:22,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:22,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:22,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:22,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:22,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash -857097881, now seen corresponding path program 4 times [2024-11-09 15:29:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:22,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638065734] [2024-11-09 15:29:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:22,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 15:29:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:22,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 15:29:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 15:29:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 15:29:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 15:29:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 39 proven. 45 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-09 15:29:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638065734] [2024-11-09 15:29:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638065734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360025932] [2024-11-09 15:29:22,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:29:22,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:22,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:22,984 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:22,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2024-11-09 15:29:23,228 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:29:23,228 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:29:23,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 15:29:23,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 22 proven. 74 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 15:29:23,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:29:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 22 proven. 74 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 15:29:23,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360025932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:29:23,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:29:23,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 26 [2024-11-09 15:29:23,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658765773] [2024-11-09 15:29:23,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:29:23,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:29:23,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 15:29:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-11-09 15:29:23,695 INFO L87 Difference]: Start difference. First operand 705 states and 890 transitions. cyclomatic complexity: 214 Second operand has 27 states, 23 states have (on average 4.782608695652174) internal successors, (110), 22 states have internal predecessors, (110), 8 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-09 15:29:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:24,094 INFO L93 Difference]: Finished difference Result 926 states and 1128 transitions. [2024-11-09 15:29:24,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 926 states and 1128 transitions. [2024-11-09 15:29:24,097 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 246 [2024-11-09 15:29:24,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 926 states to 914 states and 1116 transitions. [2024-11-09 15:29:24,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2024-11-09 15:29:24,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 720 [2024-11-09 15:29:24,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 914 states and 1116 transitions. [2024-11-09 15:29:24,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:24,104 INFO L218 hiAutomatonCegarLoop]: Abstraction has 914 states and 1116 transitions. [2024-11-09 15:29:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states and 1116 transitions. [2024-11-09 15:29:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 758. [2024-11-09 15:29:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 708 states have (on average 1.1977401129943503) internal successors, (848), 711 states have internal predecessors, (848), 29 states have call successors, (30), 22 states have call predecessors, (30), 21 states have return successors, (58), 24 states have call predecessors, (58), 26 states have call successors, (58) [2024-11-09 15:29:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 936 transitions. [2024-11-09 15:29:24,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 758 states and 936 transitions. [2024-11-09 15:29:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 15:29:24,117 INFO L425 stractBuchiCegarLoop]: Abstraction has 758 states and 936 transitions. [2024-11-09 15:29:24,117 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-09 15:29:24,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 758 states and 936 transitions. [2024-11-09 15:29:24,119 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 188 [2024-11-09 15:29:24,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:24,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:24,120 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:24,120 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:24,120 INFO L745 eck$LassoCheckResult]: Stem: 53669#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 53621#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; 53622#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; 53624#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 53625#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 53675#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 53673#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 53674#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 53676#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 53626#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 53627#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 53681#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 53680#L40-4 havoc main_~i~1#1; 53605#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 53606#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 53774#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); 53765#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 53766#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 53885#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); 53829#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 53830#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 53844#L24 assume ~n#1 < 2; 53845#merge_sortFINAL assume true; 53828#merge_sortEXIT >#88#return; 53646#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 53645#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 53647#L24 assume ~n#1 < 2; 53883#merge_sortFINAL assume true; 53882#merge_sortEXIT >#90#return; 53881#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; 53880#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 53878#L12 assume !(merge_~j~0#1 == merge_~n#1); 53877#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 53876#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 53874#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 53873#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 53872#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 53871#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 53870#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 53867#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 53865#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 53864#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 53857#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 53856#L11-4 merge_~i~0#1 := 0; 53855#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 53854#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 53853#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 53852#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 53851#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 53850#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 53849#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; 53848#merge_sortFINAL assume true; 53847#merge_sortEXIT >#88#return; 53656#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 53763#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 53764#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); 53832#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 53884#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 53886#L24 assume ~n#1 < 2; 53831#merge_sortFINAL assume true; 53833#merge_sortEXIT >#88#return; 53637#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 53657#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 53660#L24 assume ~n#1 < 2; 53661#merge_sortFINAL assume true; 53636#merge_sortEXIT >#90#return; 53638#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; 54056#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 54054#L12 assume !(merge_~j~0#1 == merge_~n#1); 54053#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 54052#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 54050#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 54049#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 54048#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 54047#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 54046#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 54043#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 54042#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 54041#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 54035#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 54034#L11-4 merge_~i~0#1 := 0; 54033#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 54032#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54031#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 54030#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54029#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 54028#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 54027#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; 54014#merge_sortFINAL assume true; 54013#merge_sortEXIT >#90#return; 53634#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; 53635#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 54222#L12 assume !(merge_~j~0#1 == merge_~n#1); 54223#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 54356#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 54346#L14-2 [2024-11-09 15:29:24,120 INFO L747 eck$LassoCheckResult]: Loop: 54346#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 54354#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 54352#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 54351#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 54350#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 54349#L12 assume !(merge_~j~0#1 == merge_~n#1); 54347#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 54345#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 54346#L14-2 [2024-11-09 15:29:24,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1462820414, now seen corresponding path program 5 times [2024-11-09 15:29:24,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:24,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264949556] [2024-11-09 15:29:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:24,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:24,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash -695534385, now seen corresponding path program 4 times [2024-11-09 15:29:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406670520] [2024-11-09 15:29:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:24,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:24,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:24,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1437839860, now seen corresponding path program 6 times [2024-11-09 15:29:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116692091] [2024-11-09 15:29:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:24,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:24,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:29:46,093 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:29:46,093 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:29:46,093 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:29:46,094 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:29:46,094 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:29:46,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:46,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:29:46,094 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:29:46,094 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration26_Lasso [2024-11-09 15:29:46,094 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:29:46,094 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:29:46,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:46,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:48,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:48,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:48,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:48,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:29:49,550 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:29:49,551 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:29:49,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,554 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-09 15:29:49,555 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-09 15:29:49,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,584 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-09 15:29:49,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,586 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-09 15:29:49,586 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-09 15:29:49,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,603 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:49,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,615 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-09 15:29:49,619 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-09 15:29:49,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,644 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-09 15:29:49,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,649 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-09 15:29:49,650 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-09 15:29:49,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-09 15:29:49,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,674 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-09 15:29:49,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,676 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-09 15:29:49,676 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-09 15:29:49,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-09 15:29:49,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,699 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-09 15:29:49,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,701 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-09 15:29:49,701 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-09 15:29:49,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:49,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,724 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-09 15:29:49,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,726 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-09 15:29:49,726 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-09 15:29:49,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,753 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-09 15:29:49,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,755 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-09 15:29:49,755 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-09 15:29:49,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:49,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,779 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-09 15:29:49,780 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-09 15:29:49,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,801 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-09 15:29:49,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,803 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-09 15:29:49,804 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-09 15:29:49,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,816 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:49,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,829 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-09 15:29:49,830 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-09 15:29:49,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,852 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-09 15:29:49,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,854 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-09 15:29:49,857 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-09 15:29:49,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:49,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:49,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,881 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-09 15:29:49,883 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-09 15:29:49,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-09 15:29:49,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:49,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,907 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-09 15:29:49,908 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-09 15:29:49,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:49,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,931 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-09 15:29:49,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,935 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-09 15:29:49,937 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-09 15:29:49,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-09 15:29:49,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,948 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2024-11-09 15:29:49,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,961 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-09 15:29:49,962 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-09 15:29:49,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:49,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:49,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:49,985 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-09 15:29:49,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:49,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:49,987 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-09 15:29:49,988 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-09 15:29:49,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:49,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:49,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:49,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:49,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:49,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:49,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:49,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,010 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-09 15:29:50,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,011 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-09 15:29:50,012 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-09 15:29:50,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:50,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:50,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:50,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,034 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-09 15:29:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,036 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-09 15:29:50,036 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-09 15:29:50,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:50,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:50,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:50,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,048 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,057 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-09 15:29:50,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,059 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-09 15:29:50,060 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-09 15:29:50,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:50,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:50,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:50,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,081 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-09 15:29:50,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,083 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-09 15:29:50,083 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-09 15:29:50,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:50,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:50,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:50,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,107 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-09 15:29:50,107 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-09 15:29:50,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:50,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:50,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:50,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:50,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,131 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-09 15:29:50,134 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-09 15:29:50,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:50,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:50,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:50,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:50,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,161 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-09 15:29:50,162 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-09 15:29:50,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:50,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:50,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:50,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,183 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-09 15:29:50,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,185 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-09 15:29:50,186 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-09 15:29:50,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:50,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:29:50,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:29:50,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:29:50,201 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,211 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-09 15:29:50,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,213 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-09 15:29:50,213 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-09 15:29:50,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:50,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:29:50,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:29:50,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:50,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,250 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-09 15:29:50,251 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-09 15:29:50,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:50,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:29:50,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:29:50,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,277 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-09 15:29:50,278 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-09 15:29:50,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 15:29:50,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:29:50,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:29:50,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:29:50,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:29:50,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Forceful destruction successful, exit code 0 [2024-11-09 15:29:50,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:50,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:50,303 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-09 15:29:50,304 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-09 15:29:50,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:29:50,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:29:50,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:29:50,315 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-09 15:29:50,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:29:50,366 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-11-09 15:29:50,366 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-09 15:29:50,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:29:52,829 INFO L443 ModelExtractionUtils]: Simplification made 58 calls to the SMT solver. [2024-11-09 15:29:52,829 INFO L444 ModelExtractionUtils]: 36 out of 136 variables were initially zero. Simplification set additionally 97 variables to zero. [2024-11-09 15:29:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:29:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:52,831 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-09 15:29:52,832 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-09 15:29:52,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:29:52,846 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2024-11-09 15:29:52,846 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:29:52,847 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~k~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~k~0#1 Supporting invariants [] [2024-11-09 15:29:52,864 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-09 15:29:52,993 INFO L156 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2024-11-09 15:29:53,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:53,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 15:29:53,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:53,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:29:53,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:29:53,469 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-09 15:29:53,469 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-09 15:29:53,469 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 758 states and 936 transitions. cyclomatic complexity: 206 Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-09 15:29:53,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 758 states and 936 transitions. cyclomatic complexity: 206. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 1779 states and 2246 transitions. Complement of second has 14 states. [2024-11-09 15:29:53,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:29:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-09 15:29:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-11-09 15:29:53,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 95 letters. Loop has 8 letters. [2024-11-09 15:29:53,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:29:53,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 103 letters. Loop has 8 letters. [2024-11-09 15:29:53,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:29:53,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 95 letters. Loop has 16 letters. [2024-11-09 15:29:53,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:29:53,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1779 states and 2246 transitions. [2024-11-09 15:29:53,524 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 308 [2024-11-09 15:29:53,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1779 states to 1635 states and 2076 transitions. [2024-11-09 15:29:53,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1080 [2024-11-09 15:29:53,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1143 [2024-11-09 15:29:53,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1635 states and 2076 transitions. [2024-11-09 15:29:53,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:29:53,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1635 states and 2076 transitions. [2024-11-09 15:29:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states and 2076 transitions. [2024-11-09 15:29:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1426. [2024-11-09 15:29:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1344 states have (on average 1.2366071428571428) internal successors, (1662), 1349 states have internal predecessors, (1662), 46 states have call successors, (47), 33 states have call predecessors, (47), 36 states have return successors, (136), 43 states have call predecessors, (136), 43 states have call successors, (136) [2024-11-09 15:29:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1845 transitions. [2024-11-09 15:29:53,548 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1426 states and 1845 transitions. [2024-11-09 15:29:53,548 INFO L425 stractBuchiCegarLoop]: Abstraction has 1426 states and 1845 transitions. [2024-11-09 15:29:53,548 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-09 15:29:53,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 1845 transitions. [2024-11-09 15:29:53,552 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 308 [2024-11-09 15:29:53,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:53,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:53,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:53,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:53,554 INFO L745 eck$LassoCheckResult]: Stem: 56677#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 56620#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; 56621#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; 56623#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 56624#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 56686#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 56684#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 56685#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 56687#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 56625#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#0(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1; 56626#L40-2 main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 56692#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 56691#L40-4 havoc main_~i~1#1; 56597#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 56598#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 56772#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); 56764#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 56765#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 56919#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); 56915#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 56916#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 56920#L24 assume ~n#1 < 2; 56918#merge_sortFINAL assume true; 56914#merge_sortEXIT >#88#return; 56911#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 56912#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 56917#L24 assume ~n#1 < 2; 56913#merge_sortFINAL assume true; 56910#merge_sortEXIT >#90#return; 56909#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; 56908#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56906#L12 assume !(merge_~j~0#1 == merge_~n#1); 56905#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 56904#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 56902#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 56901#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 56900#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 56899#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 56898#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 56894#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 56892#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 56893#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 56888#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 56889#L11-4 merge_~i~0#1 := 0; 56884#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 56885#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 56881#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 56875#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 56873#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 56874#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 56866#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; 56867#merge_sortFINAL assume true; 56851#merge_sortEXIT >#88#return; 56615#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 56762#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 56763#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); 56646#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 56647#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 56924#L24 assume ~n#1 < 2; 56925#merge_sortFINAL assume true; 56921#merge_sortEXIT >#88#return; 56641#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 56663#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 57903#L24 assume ~n#1 < 2; 57902#merge_sortFINAL assume true; 56640#merge_sortEXIT >#90#return; 56642#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; 57329#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 57330#L12 assume !(merge_~j~0#1 == merge_~n#1); 57328#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 57343#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 57342#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 57341#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 57340#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 57339#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 57338#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 57337#L12 assume !(merge_~j~0#1 == merge_~n#1); 57335#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 57310#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 57307#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 57305#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 57306#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 57896#L11-4 merge_~i~0#1 := 0; 57895#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 57894#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 57893#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#1(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#0(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1; 57892#L17-2 merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 57891#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 57890#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 57889#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; 57888#merge_sortFINAL assume true; 57272#merge_sortEXIT >#90#return; 56638#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; 56639#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 57840#L12 assume !(merge_~j~0#1 == merge_~n#1); 57842#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 57986#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 57984#L14-2 [2024-11-09 15:29:53,554 INFO L747 eck$LassoCheckResult]: Loop: 57984#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 57982#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 57981#L12-2 call write~int#1(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1; 57980#L11-2 merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 57978#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 57976#L12 assume !(merge_~j~0#1 == merge_~n#1); 57920#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 57922#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#0(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 57984#L14-2 [2024-11-09 15:29:53,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash -533440979, now seen corresponding path program 8 times [2024-11-09 15:29:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:53,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262634986] [2024-11-09 15:29:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:29:53,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:29:53,687 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