./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:10:54,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:10:54,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:10:54,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:10:54,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:10:54,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:10:54,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:10:54,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:10:54,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:10:54,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:10:54,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:10:54,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:10:54,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:10:54,516 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:10:54,517 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:10:54,517 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:10:54,517 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:10:54,517 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:10:54,518 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:10:54,518 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:10:54,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:10:54,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:10:54,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:10:54,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:10:54,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:10:54,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:10:54,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:10:54,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:10:54,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:10:54,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:10:54,521 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:10:54,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:10:54,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:10:54,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:10:54,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:10:54,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:10:54,524 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:10:54,524 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-17 08:10:54,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:10:54,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:10:54,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:10:54,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:10:54,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:10:54,839 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-17 08:10:56,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:10:56,429 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:10:56,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2024-11-17 08:10:56,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa752f6e4/190b223616b04fbdbc5170ffdff87027/FLAGd01bb3a97 [2024-11-17 08:10:56,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa752f6e4/190b223616b04fbdbc5170ffdff87027 [2024-11-17 08:10:56,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:10:56,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:10:56,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:10:56,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:10:56,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:10:56,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591f88cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56, skipping insertion in model container [2024-11-17 08:10:56,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:10:56,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:10:56,673 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:10:56,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:10:56,719 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:10:56,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56 WrapperNode [2024-11-17 08:10:56,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:10:56,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:10:56,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:10:56,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:10:56,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,755 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-11-17 08:10:56,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:10:56,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:10:56,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:10:56,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:10:56,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,783 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2]. [2024-11-17 08:10:56,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:10:56,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:10:56,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:10:56,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:10:56,793 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (1/1) ... [2024-11-17 08:10:56,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:56,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:56,837 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-17 08:10:56,841 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-17 08:10:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:10:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:10:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2024-11-17 08:10:56,875 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2024-11-17 08:10:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 08:10:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:10:56,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:10:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:10:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:10:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:10:56,939 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:10:56,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:10:57,178 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-17 08:10:57,178 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:10:57,190 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:10:57,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:10:57,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:10:57 BoogieIcfgContainer [2024-11-17 08:10:57,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:10:57,192 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:10:57,193 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:10:57,196 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:10:57,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:10:57,197 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:10:56" (1/3) ... [2024-11-17 08:10:57,198 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dc4c1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:10:57, skipping insertion in model container [2024-11-17 08:10:57,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:10:57,198 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:10:56" (2/3) ... [2024-11-17 08:10:57,199 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3dc4c1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:10:57, skipping insertion in model container [2024-11-17 08:10:57,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:10:57,199 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:10:57" (3/3) ... [2024-11-17 08:10:57,201 INFO L332 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2024-11-17 08:10:57,263 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:10:57,263 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:10:57,263 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:10:57,263 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:10:57,263 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:10:57,264 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:10:57,264 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:10:57,264 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:10:57,268 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-17 08:10:57,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-17 08:10:57,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:57,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:57,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:10:57,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:57,292 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:10:57,293 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-17 08:10:57,295 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2024-11-17 08:10:57,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:57,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:57,296 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:10:57,296 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:10:57,302 INFO L745 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 27#ULTIMATE.init_returnLabel#1true assume true;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; 15#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; 28#L40-1true [2024-11-17 08:10:57,302 INFO L747 eck$LassoCheckResult]: Loop: 28#L40-1true assume true; 9#L40-2true assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28#L40-1true [2024-11-17 08:10:57,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash 76429, now seen corresponding path program 1 times [2024-11-17 08:10:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534703533] [2024-11-17 08:10:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:57,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:57,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:57,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2208, now seen corresponding path program 1 times [2024-11-17 08:10:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175553837] [2024-11-17 08:10:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:57,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:57,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:57,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash 73449516, now seen corresponding path program 1 times [2024-11-17 08:10:57,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400729532] [2024-11-17 08:10:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:57,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:57,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:57,763 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:10:57,764 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:10:57,764 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:10:57,764 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:10:57,764 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:10:57,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:57,765 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:10:57,765 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:10:57,765 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2024-11-17 08:10:57,765 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:10:57,766 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:10:57,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:57,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:57,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:57,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:57,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:57,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:57,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:10:58,132 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:10:58,136 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:10:58,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,142 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-17 08:10:58,144 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-17 08:10:58,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:58,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:58,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:58,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:58,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:58,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:58,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:58,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:58,165 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:58,181 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-17 08:10:58,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,185 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-17 08:10:58,186 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-17 08:10:58,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:58,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:58,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:58,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:58,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:58,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:58,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:58,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:58,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:58,221 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-17 08:10:58,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,224 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-17 08:10:58,226 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-17 08:10:58,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:58,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:58,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:58,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:58,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:58,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:58,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:58,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:58,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:58,258 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-17 08:10:58,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,262 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-17 08:10:58,264 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-17 08:10:58,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-17 08:10:58,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:58,278 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-17 08:10:58,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:58,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:58,285 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:10:58,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:58,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:58,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:58,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,314 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-17 08:10:58,317 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-17 08:10:58,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:58,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:58,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:10:58,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:58,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:58,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:58,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:10:58,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:10:58,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:58,355 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-17 08:10:58,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,357 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-17 08:10:58,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:58,361 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-17 08:10:58,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:58,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:58,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:58,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:58,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:58,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:58,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:58,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:10:58,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,400 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-17 08:10:58,401 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-17 08:10:58,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:58,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:58,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:58,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:58,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:58,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:58,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:58,424 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:10:58,439 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-17 08:10:58,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,442 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-17 08:10:58,443 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-17 08:10:58,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:10:58,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:10:58,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:10:58,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:10:58,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:10:58,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:10:58,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:10:58,473 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:10:58,497 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-17 08:10:58,498 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:10:58,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:10:58,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:58,520 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-17 08:10:58,521 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-17 08:10:58,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:10:58,541 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:10:58,541 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:10:58,542 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~a~0#1.offset >= 0] [2024-11-17 08:10:58,557 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-17 08:10:58,570 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2024-11-17 08:10:58,581 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:10:58,582 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:10:58,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:58,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:10:58,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:58,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:10:58,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:58,672 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-17 08:10:58,711 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-17 08:10:58,713 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-17 08:10:58,798 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-17 08:10:58,824 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 84 transitions. Complement of second has 7 states. [2024-11-17 08:10:58,830 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-17 08:10:58,839 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-17 08:10:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-11-17 08:10:58,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-17 08:10:58,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:58,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-17 08:10:58,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:58,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-17 08:10:58,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:10:58,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 84 transitions. [2024-11-17 08:10:58,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-17 08:10:58,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 29 states and 40 transitions. [2024-11-17 08:10:58,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-17 08:10:58,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-17 08:10:58,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2024-11-17 08:10:58,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:58,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-11-17 08:10:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2024-11-17 08:10:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-17 08:10:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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-17 08:10:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2024-11-17 08:10:58,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-11-17 08:10:58,908 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2024-11-17 08:10:58,908 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:10:58,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2024-11-17 08:10:58,909 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-17 08:10:58,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:58,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:58,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:58,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:10:58,910 INFO L745 eck$LassoCheckResult]: Stem: 171#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 172#ULTIMATE.init_returnLabel#1 assume true;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; 168#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; 169#L40-1 assume true; 158#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 159#L40 havoc main_~i~1#1; 148#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 150#merge_sortENTRY [2024-11-17 08:10:58,911 INFO L747 eck$LassoCheckResult]: Loop: 150#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 151#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); 146#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 150#merge_sortENTRY [2024-11-17 08:10:58,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1865507325, now seen corresponding path program 1 times [2024-11-17 08:10:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968575779] [2024-11-17 08:10:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:58,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:59,035 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-17 08:10:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968575779] [2024-11-17 08:10:59,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968575779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:10:59,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:10:59,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:10:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125581244] [2024-11-17 08:10:59,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:10:59,039 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:10:59,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 58579, now seen corresponding path program 1 times [2024-11-17 08:10:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:59,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417798509] [2024-11-17 08:10:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:10:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:10:59,277 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 08:10:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:59,292 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-17 08:10:59,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2024-11-17 08:10:59,293 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-17 08:10:59,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 38 transitions. [2024-11-17 08:10:59,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-17 08:10:59,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-17 08:10:59,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2024-11-17 08:10:59,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:59,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-17 08:10:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2024-11-17 08:10:59,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-17 08:10:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-17 08:10:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-17 08:10:59,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-17 08:10:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:10:59,302 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-17 08:10:59,302 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:10:59,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2024-11-17 08:10:59,303 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-17 08:10:59,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:59,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:59,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:59,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:10:59,303 INFO L745 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 238#ULTIMATE.init_returnLabel#1 assume true;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; 234#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; 235#L40-1 assume true; 226#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 227#L40-1 assume true; 224#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 225#L40 havoc main_~i~1#1; 214#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 216#merge_sortENTRY [2024-11-17 08:10:59,304 INFO L747 eck$LassoCheckResult]: Loop: 216#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 217#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); 212#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 216#merge_sortENTRY [2024-11-17 08:10:59,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:59,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1753157660, now seen corresponding path program 1 times [2024-11-17 08:10:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:59,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685554487] [2024-11-17 08:10:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:59,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash 58579, now seen corresponding path program 2 times [2024-11-17 08:10:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:59,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980608213] [2024-11-17 08:10:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1517558488, now seen corresponding path program 1 times [2024-11-17 08:10:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403337285] [2024-11-17 08:10:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:59,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:59,510 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-17 08:10:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:10:59,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403337285] [2024-11-17 08:10:59,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403337285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:10:59,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39881274] [2024-11-17 08:10:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:10:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:10:59,514 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:10:59,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 08:10:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:10:59,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:10:59,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:10:59,614 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-17 08:10:59,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:10:59,668 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-17 08:10:59,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39881274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:10:59,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:10:59,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-17 08:10:59,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263566217] [2024-11-17 08:10:59,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:10:59,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:10:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 08:10:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 08:10:59,879 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. cyclomatic complexity: 12 Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-17 08:10:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:10:59,926 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-17 08:10:59,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2024-11-17 08:10:59,927 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-17 08:10:59,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 32 states and 40 transitions. [2024-11-17 08:10:59,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-17 08:10:59,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-17 08:10:59,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2024-11-17 08:10:59,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:10:59,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-17 08:10:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2024-11-17 08:10:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-17 08:10:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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-17 08:10:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-17 08:10:59,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-17 08:10:59,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:10:59,934 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-17 08:10:59,934 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:10:59,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2024-11-17 08:10:59,935 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-17 08:10:59,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:10:59,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:10:59,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-11-17 08:10:59,935 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:10:59,935 INFO L745 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 387#ULTIMATE.init_returnLabel#1 assume true;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; 383#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; 384#L40-1 assume true; 375#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 376#L40-1 assume true; 388#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 390#L40-1 assume true; 373#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 374#L40 havoc main_~i~1#1; 361#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 360#merge_sortENTRY [2024-11-17 08:10:59,936 INFO L747 eck$LassoCheckResult]: Loop: 360#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 364#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); 362#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 360#merge_sortENTRY [2024-11-17 08:10:59,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1159311995, now seen corresponding path program 2 times [2024-11-17 08:10:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:59,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164543965] [2024-11-17 08:10:59,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:59,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash 58579, now seen corresponding path program 3 times [2024-11-17 08:10:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748220337] [2024-11-17 08:10:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:10:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:10:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:10:59,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:10:59,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:10:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1231644697, now seen corresponding path program 2 times [2024-11-17 08:10:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:10:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307827415] [2024-11-17 08:10:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:10:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:00,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:00,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:00,670 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:00,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:00,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:00,670 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:00,671 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:00,671 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:00,671 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:00,671 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:00,671 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2024-11-17 08:11:00,671 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:00,671 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:00,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:00,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:01,306 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:01,306 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:01,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,308 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-17 08:11:01,311 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-17 08:11:01,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-17 08:11:01,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,328 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,343 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-17 08:11:01,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,345 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-17 08:11:01,346 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-17 08:11:01,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:01,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,380 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:01,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:11:01,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:11:01,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,414 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-17 08:11:01,416 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-17 08:11:01,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,435 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:01,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,453 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-17 08:11:01,455 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-17 08:11:01,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,490 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-17 08:11:01,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,492 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-17 08:11:01,494 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-17 08:11:01,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,508 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,523 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-17 08:11:01,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,527 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-17 08:11:01,528 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-17 08:11:01,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,558 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-17 08:11:01,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,559 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-17 08:11:01,561 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-17 08:11:01,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,593 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-17 08:11:01,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,597 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-17 08:11:01,598 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-17 08:11:01,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:01,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:01,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:01,617 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:01,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-17 08:11:01,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,633 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-17 08:11:01,635 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-17 08:11:01,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:01,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:01,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:01,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:01,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:01,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:01,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:01,661 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:01,678 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-17 08:11:01,678 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-17 08:11:01,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:01,681 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-17 08:11:01,682 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-17 08:11:01,683 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:01,697 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:11:01,698 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:01,698 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-17 08:11:01,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:01,716 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2024-11-17 08:11:01,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:01,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:11:01,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:01,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:11:01,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:01,814 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-17 08:11:01,815 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-17 08:11:01,815 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 39 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-17 08:11:01,865 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 39 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 49 states and 61 transitions. Complement of second has 16 states. [2024-11-17 08:11:01,865 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-17 08:11:01,866 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-17 08:11:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-17 08:11:01,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2024-11-17 08:11:01,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:01,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-17 08:11:01,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:01,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 11 letters. Loop has 6 letters. [2024-11-17 08:11:01,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:01,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2024-11-17 08:11:01,869 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-17 08:11:01,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 40 states and 52 transitions. [2024-11-17 08:11:01,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-17 08:11:01,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-11-17 08:11:01,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2024-11-17 08:11:01,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:01,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-17 08:11:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2024-11-17 08:11:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-17 08:11:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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-17 08:11:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-17 08:11:01,880 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-17 08:11:01,880 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-17 08:11:01,880 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:11:01,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2024-11-17 08:11:01,881 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2024-11-17 08:11:01,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:01,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:01,882 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:01,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:01,885 INFO L745 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 558#ULTIMATE.init_returnLabel#1 assume true;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; 552#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; 553#L40-1 assume true; 544#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 545#L40-1 assume true; 559#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 563#L40-1 assume true; 542#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 543#L40 havoc main_~i~1#1; 527#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 532#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 533#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); 528#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 534#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 535#L24 assume ~n#1 < 2; 550#merge_sortFINAL assume true; 549#merge_sortEXIT >#52#return; 529#L28-1 [2024-11-17 08:11:01,885 INFO L747 eck$LassoCheckResult]: Loop: 529#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 554#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 562#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); 530#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 554#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 562#L24 assume ~n#1 < 2; 555#merge_sortFINAL assume true; 561#merge_sortEXIT >#52#return; 529#L28-1 [2024-11-17 08:11:01,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash 669206476, now seen corresponding path program 1 times [2024-11-17 08:11:01,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:01,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279261443] [2024-11-17 08:11:01,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:01,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:01,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:01,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:01,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1491685289, now seen corresponding path program 1 times [2024-11-17 08:11:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:01,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861984828] [2024-11-17 08:11:01,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:01,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:01,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:01,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash -922288862, now seen corresponding path program 1 times [2024-11-17 08:11:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:01,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112423657] [2024-11-17 08:11:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:02,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 08:11:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:02,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-17 08:11:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:11:02,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112423657] [2024-11-17 08:11:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112423657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044600211] [2024-11-17 08:11:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:02,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:02,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:02,219 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:02,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-17 08:11:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:02,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:11:02,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:02,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:02,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-17 08:11:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 08:11:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044600211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:02,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-11-17 08:11:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191380193] [2024-11-17 08:11:02,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:02,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 08:11:02,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-17 08:11:02,899 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 15 Second operand has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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-17 08:11:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:03,098 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2024-11-17 08:11:03,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 95 transitions. [2024-11-17 08:11:03,099 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2024-11-17 08:11:03,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 72 states and 90 transitions. [2024-11-17 08:11:03,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-17 08:11:03,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-11-17 08:11:03,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 90 transitions. [2024-11-17 08:11:03,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:03,101 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 90 transitions. [2024-11-17 08:11:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 90 transitions. [2024-11-17 08:11:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-11-17 08:11:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-17 08:11:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2024-11-17 08:11:03,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 85 transitions. [2024-11-17 08:11:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 08:11:03,108 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2024-11-17 08:11:03,108 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:11:03,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 85 transitions. [2024-11-17 08:11:03,109 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-17 08:11:03,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:03,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:03,110 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:03,110 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:03,110 INFO L745 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 865#ULTIMATE.init_returnLabel#1 assume true;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; 860#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; 861#L40-1 assume true; 849#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 850#L40-1 assume true; 867#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 897#L40-1 assume true; 879#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 878#L40-1 assume true; 876#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 873#L40 havoc main_~i~1#1; 858#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 871#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 836#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); 835#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 834#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 837#L24 assume ~n#1 < 2; 866#merge_sortFINAL assume true; 854#merge_sortEXIT >#52#return; 831#L28-1 [2024-11-17 08:11:03,111 INFO L747 eck$LassoCheckResult]: Loop: 831#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 830#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 833#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); 832#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 830#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 833#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); 832#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 830#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 833#L24 assume ~n#1 < 2; 855#merge_sortFINAL assume true; 856#merge_sortEXIT >#52#return; 831#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 830#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 833#L24 assume ~n#1 < 2; 855#merge_sortFINAL assume true; 856#merge_sortEXIT >#50#return; 880#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; 877#L11 assume true; 874#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 872#L17-2 merge_~i~0#1 := 0; 870#L17 assume true; 869#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 857#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 859#merge_returnLabel#1 assume true;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; 862#merge_sortFINAL assume true; 898#merge_sortEXIT >#52#return; 831#L28-1 [2024-11-17 08:11:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -111157171, now seen corresponding path program 2 times [2024-11-17 08:11:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791767067] [2024-11-17 08:11:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:03,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:03,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:03,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1036580891, now seen corresponding path program 1 times [2024-11-17 08:11:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:03,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187887322] [2024-11-17 08:11:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:03,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 08:11:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 08:11:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:03,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187887322] [2024-11-17 08:11:03,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187887322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:03,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023134467] [2024-11-17 08:11:03,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:03,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:03,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:03,350 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:03,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-17 08:11:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:11:03,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 08:11:03,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:11:03,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023134467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:11:03,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:11:03,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-17 08:11:03,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082042505] [2024-11-17 08:11:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:11:03,447 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:11:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:03,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:11:03,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:11:03,448 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 08:11:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:03,474 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2024-11-17 08:11:03,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 107 transitions. [2024-11-17 08:11:03,475 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-17 08:11:03,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 107 transitions. [2024-11-17 08:11:03,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2024-11-17 08:11:03,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2024-11-17 08:11:03,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 107 transitions. [2024-11-17 08:11:03,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:03,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 107 transitions. [2024-11-17 08:11:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 107 transitions. [2024-11-17 08:11:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2024-11-17 08:11:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 62 states have internal predecessors, (74), 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-17 08:11:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2024-11-17 08:11:03,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 89 transitions. [2024-11-17 08:11:03,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:11:03,490 INFO L425 stractBuchiCegarLoop]: Abstraction has 73 states and 89 transitions. [2024-11-17 08:11:03,490 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:11:03,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 89 transitions. [2024-11-17 08:11:03,491 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-17 08:11:03,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:03,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:03,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:03,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:03,492 INFO L745 eck$LassoCheckResult]: Stem: 1137#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1138#ULTIMATE.init_returnLabel#1 assume true;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; 1132#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; 1133#L40-1 assume true; 1116#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1117#L40-1 assume true; 1142#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1157#L40-1 assume true; 1155#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1154#L40-1 assume true; 1152#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 1149#L40 havoc main_~i~1#1; 1128#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1147#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1104#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); 1103#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1102#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1105#L24 assume ~n#1 < 2; 1124#merge_sortFINAL assume true; 1125#merge_sortEXIT >#52#return; 1129#L28-1 [2024-11-17 08:11:03,492 INFO L747 eck$LassoCheckResult]: Loop: 1129#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1161#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1166#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); 1127#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1161#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1166#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); 1127#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1161#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1166#L24 assume ~n#1 < 2; 1165#merge_sortFINAL assume true; 1163#merge_sortEXIT >#52#return; 1129#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1161#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1166#L24 assume ~n#1 < 2; 1165#merge_sortFINAL assume true; 1163#merge_sortEXIT >#50#return; 1160#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; 1139#L11 assume true; 1140#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 1151#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 1156#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1153#L11 assume true; 1150#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 1148#L17-2 merge_~i~0#1 := 0; 1146#L17 assume true; 1145#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 1126#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1130#merge_returnLabel#1 assume true;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; 1134#merge_sortFINAL assume true; 1159#merge_sortEXIT >#52#return; 1129#L28-1 [2024-11-17 08:11:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -111157171, now seen corresponding path program 3 times [2024-11-17 08:11:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704314145] [2024-11-17 08:11:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:03,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:03,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:03,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2041001689, now seen corresponding path program 1 times [2024-11-17 08:11:03,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:03,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462913732] [2024-11-17 08:11:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:03,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 08:11:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 08:11:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462913732] [2024-11-17 08:11:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462913732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140968120] [2024-11-17 08:11:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:03,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:03,676 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:03,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-17 08:11:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:03,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:11:03,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 08:11:03,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 08:11:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140968120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:03,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:03,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-17 08:11:03,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303279596] [2024-11-17 08:11:03,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:03,944 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:11:03,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 08:11:03,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-17 08:11:03,945 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. cyclomatic complexity: 23 Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 12 states have internal predecessors, (38), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-17 08:11:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:04,360 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2024-11-17 08:11:04,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 206 transitions. [2024-11-17 08:11:04,365 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 71 [2024-11-17 08:11:04,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 163 states and 206 transitions. [2024-11-17 08:11:04,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2024-11-17 08:11:04,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2024-11-17 08:11:04,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 206 transitions. [2024-11-17 08:11:04,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:04,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 206 transitions. [2024-11-17 08:11:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 206 transitions. [2024-11-17 08:11:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 91. [2024-11-17 08:11:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.240506329113924) internal successors, (98), 80 states have internal predecessors, (98), 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-17 08:11:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-17 08:11:04,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-17 08:11:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 08:11:04,386 INFO L425 stractBuchiCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-17 08:11:04,387 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:11:04,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 113 transitions. [2024-11-17 08:11:04,388 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 40 [2024-11-17 08:11:04,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:04,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:04,389 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:04,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:04,389 INFO L745 eck$LassoCheckResult]: Stem: 1627#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1628#ULTIMATE.init_returnLabel#1 assume true;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; 1620#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; 1621#L40-1 assume true; 1609#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1610#L40-1 assume true; 1631#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1641#L40-1 assume true; 1642#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1643#L40-1 assume true; 1638#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 1637#L40 havoc main_~i~1#1; 1593#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1636#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1599#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); 1590#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1598#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1600#L24 assume ~n#1 < 2; 1652#merge_sortFINAL assume true; 1649#merge_sortEXIT >#52#return; 1591#L28-1 [2024-11-17 08:11:04,390 INFO L747 eck$LassoCheckResult]: Loop: 1591#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1645#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1639#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); 1592#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1645#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1639#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); 1592#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1645#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1639#L24 assume ~n#1 < 2; 1640#merge_sortFINAL assume true; 1651#merge_sortEXIT >#52#return; 1591#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1645#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1639#L24 assume ~n#1 < 2; 1640#merge_sortFINAL assume true; 1651#merge_sortEXIT >#50#return; 1613#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; 1614#L11 assume true; 1601#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 1602#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 1632#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 1633#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 1611#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1612#L11 assume true; 1662#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 1655#L17-2 merge_~i~0#1 := 0; 1654#L17 assume true; 1653#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 1635#L17 assume true; 1634#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 1618#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1619#merge_returnLabel#1 assume true;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; 1624#merge_sortFINAL assume true; 1650#merge_sortEXIT >#52#return; 1591#L28-1 [2024-11-17 08:11:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash -111157171, now seen corresponding path program 4 times [2024-11-17 08:11:04,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:04,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397016729] [2024-11-17 08:11:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:04,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:04,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:04,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:04,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:04,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1466934060, now seen corresponding path program 1 times [2024-11-17 08:11:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:04,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121703990] [2024-11-17 08:11:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:04,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-17 08:11:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:04,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 08:11:04,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121703990] [2024-11-17 08:11:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121703990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:11:04,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:11:04,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 08:11:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245258963] [2024-11-17 08:11:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:11:04,638 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:11:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:04,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:11:04,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:11:04,639 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 08:11:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:04,703 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2024-11-17 08:11:04,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 141 transitions. [2024-11-17 08:11:04,705 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 55 [2024-11-17 08:11:04,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 113 states and 141 transitions. [2024-11-17 08:11:04,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-11-17 08:11:04,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-11-17 08:11:04,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 141 transitions. [2024-11-17 08:11:04,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:04,709 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 141 transitions. [2024-11-17 08:11:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 141 transitions. [2024-11-17 08:11:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-17 08:11:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 98 states have internal predecessors, (120), 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-17 08:11:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2024-11-17 08:11:04,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 135 transitions. [2024-11-17 08:11:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:11:04,716 INFO L425 stractBuchiCegarLoop]: Abstraction has 109 states and 135 transitions. [2024-11-17 08:11:04,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:11:04,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 135 transitions. [2024-11-17 08:11:04,717 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2024-11-17 08:11:04,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:04,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:04,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:04,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:04,718 INFO L745 eck$LassoCheckResult]: Stem: 1881#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1882#ULTIMATE.init_returnLabel#1 assume true;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; 1873#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; 1874#L40-1 assume true; 1862#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1863#L40-1 assume true; 1887#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1900#L40-1 assume true; 1899#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1898#L40-1 assume true; 1896#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 1894#L40 havoc main_~i~1#1; 1845#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1892#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1853#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); 1846#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1851#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1852#L24 assume ~n#1 < 2; 1911#merge_sortFINAL assume true; 1908#merge_sortEXIT >#52#return; 1843#L28-1 [2024-11-17 08:11:04,718 INFO L747 eck$LassoCheckResult]: Loop: 1843#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1906#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1901#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); 1844#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1906#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1901#L24 assume ~n#1 < 2; 1902#merge_sortFINAL assume true; 1909#merge_sortEXIT >#52#return; 1843#L28-1 [2024-11-17 08:11:04,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash -111157171, now seen corresponding path program 5 times [2024-11-17 08:11:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104302643] [2024-11-17 08:11:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:04,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:04,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:04,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:04,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:04,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1491685289, now seen corresponding path program 2 times [2024-11-17 08:11:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:04,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761629390] [2024-11-17 08:11:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:04,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:04,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:04,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:04,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1226341213, now seen corresponding path program 2 times [2024-11-17 08:11:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:04,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37132327] [2024-11-17 08:11:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:04,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:04,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:05,987 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:05,987 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:05,987 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:05,987 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:05,987 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:05,987 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:05,987 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:05,987 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:05,987 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration9_Lasso [2024-11-17 08:11:05,987 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:05,988 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:05,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:05,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:05,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:06,551 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:06,551 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:06,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,554 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-17 08:11:06,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,557 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-17 08:11:06,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:06,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:06,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:06,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-17 08:11:06,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,591 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-17 08:11:06,592 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-17 08:11:06,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:06,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:06,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:06,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,614 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-17 08:11:06,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,616 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-17 08:11:06,617 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-17 08:11:06,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-17 08:11:06,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:06,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:06,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:06,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,653 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-17 08:11:06,654 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-17 08:11:06,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:06,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:06,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:11:06,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,689 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-17 08:11:06,690 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-17 08:11:06,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:06,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:06,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,717 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-17 08:11:06,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,718 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-17 08:11:06,719 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-17 08:11:06,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:06,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:06,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:06,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,746 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-17 08:11:06,747 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-17 08:11:06,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:06,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:06,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-17 08:11:06,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,774 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-17 08:11:06,776 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-17 08:11:06,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,788 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-17 08:11:06,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,791 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:11:06,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:06,796 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-17 08:11:06,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,807 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-17 08:11:06,808 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-17 08:11:06,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:06,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:06,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,836 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-17 08:11:06,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,838 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-17 08:11:06,839 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-17 08:11:06,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:06,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:06,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:06,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-17 08:11:06,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,866 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-17 08:11:06,867 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-17 08:11:06,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-17 08:11:06,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:06,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:06,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:06,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,890 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-17 08:11:06,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,892 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-17 08:11:06,893 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-17 08:11:06,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:06,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:06,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:06,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,931 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-17 08:11:06,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,933 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-17 08:11:06,934 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-17 08:11:06,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:06,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:06,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:06,946 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,956 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-17 08:11:06,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,958 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-17 08:11:06,959 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-17 08:11:06,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:06,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:06,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:06,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:06,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:06,981 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-17 08:11:06,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:06,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:06,982 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-17 08:11:06,984 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-17 08:11:06,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-17 08:11:06,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:06,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:06,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:06,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:06,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:06,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:06,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:06,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,006 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-17 08:11:07,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,008 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-17 08:11:07,009 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-17 08:11:07,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-17 08:11:07,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,036 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-17 08:11:07,037 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-17 08:11:07,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:07,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,061 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-17 08:11:07,062 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-17 08:11:07,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,084 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-17 08:11:07,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,088 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-17 08:11:07,091 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-17 08:11:07,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,121 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-17 08:11:07,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,123 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-17 08:11:07,124 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-17 08:11:07,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-17 08:11:07,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,147 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-17 08:11:07,148 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-17 08:11:07,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-17 08:11:07,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,172 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-17 08:11:07,173 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-17 08:11:07,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,195 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-17 08:11:07,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,196 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-17 08:11:07,197 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-17 08:11:07,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,219 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-17 08:11:07,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,221 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-17 08:11:07,221 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-17 08:11:07,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-17 08:11:07,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,245 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-17 08:11:07,246 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-17 08:11:07,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,268 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-17 08:11:07,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,270 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-17 08:11:07,270 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-17 08:11:07,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-17 08:11:07,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,294 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-17 08:11:07,295 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-17 08:11:07,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-17 08:11:07,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,318 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-17 08:11:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,320 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-17 08:11:07,321 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-17 08:11:07,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-17 08:11:07,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,345 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-17 08:11:07,345 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-17 08:11:07,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,357 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-17 08:11:07,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,369 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-17 08:11:07,370 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-17 08:11:07,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:07,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,394 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-17 08:11:07,395 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-17 08:11:07,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,417 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-17 08:11:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,419 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:07,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-17 08:11:07,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-17 08:11:07,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,442 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-17 08:11:07,443 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-17 08:11:07,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:07,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,468 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-17 08:11:07,469 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-17 08:11:07,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,491 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-17 08:11:07,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,493 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-17 08:11:07,494 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-17 08:11:07,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-17 08:11:07,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,517 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-17 08:11:07,518 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-17 08:11:07,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-17 08:11:07,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,542 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-17 08:11:07,542 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-17 08:11:07,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-17 08:11:07,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,566 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-17 08:11:07,566 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-17 08:11:07,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,588 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-17 08:11:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,589 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-17 08:11:07,590 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-17 08:11:07,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-17 08:11:07,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,613 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-17 08:11:07,614 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-17 08:11:07,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-17 08:11:07,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,639 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-17 08:11:07,640 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-17 08:11:07,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,662 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-17 08:11:07,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,663 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-17 08:11:07,664 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-17 08:11:07,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,693 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-17 08:11:07,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,695 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-17 08:11:07,696 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-17 08:11:07,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-17 08:11:07,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,728 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-17 08:11:07,729 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-17 08:11:07,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:07,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:07,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:07,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:07,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-17 08:11:07,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,761 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-17 08:11:07,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:07,767 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-17 08:11:07,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:07,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:07,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:07,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:07,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:07,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:07,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:07,812 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-17 08:11:07,812 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-17 08:11:07,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:07,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:07,814 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-17 08:11:07,816 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-17 08:11:07,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:07,832 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:11:07,832 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:07,832 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-17 08:11:07,847 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-17 08:11:07,855 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-11-17 08:11:07,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:07,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:07,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:07,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:11:07,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:08,043 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-17 08:11:08,044 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-17 08:11:08,044 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 135 transitions. cyclomatic complexity: 35 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-17 08:11:08,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 135 transitions. cyclomatic complexity: 35. 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 320 states and 418 transitions. Complement of second has 28 states. [2024-11-17 08:11:08,168 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-17 08:11:08,169 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-17 08:11:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2024-11-17 08:11:08,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 20 letters. Loop has 8 letters. [2024-11-17 08:11:08,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:08,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 28 letters. Loop has 8 letters. [2024-11-17 08:11:08,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:08,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 51 transitions. Stem has 20 letters. Loop has 16 letters. [2024-11-17 08:11:08,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:08,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 418 transitions. [2024-11-17 08:11:08,197 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 108 [2024-11-17 08:11:08,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 307 states and 405 transitions. [2024-11-17 08:11:08,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2024-11-17 08:11:08,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-17 08:11:08,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2024-11-17 08:11:08,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 405 transitions. [2024-11-17 08:11:08,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:08,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 307 states and 405 transitions. [2024-11-17 08:11:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 405 transitions. [2024-11-17 08:11:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2024-11-17 08:11:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 257 states have (on average 1.2607003891050583) internal successors, (324), 258 states have internal predecessors, (324), 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-17 08:11:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 367 transitions. [2024-11-17 08:11:08,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 287 states and 367 transitions. [2024-11-17 08:11:08,217 INFO L425 stractBuchiCegarLoop]: Abstraction has 287 states and 367 transitions. [2024-11-17 08:11:08,217 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:11:08,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 287 states and 367 transitions. [2024-11-17 08:11:08,219 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 108 [2024-11-17 08:11:08,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:08,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:08,220 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:08,220 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:11:08,220 INFO L745 eck$LassoCheckResult]: Stem: 2479#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2480#ULTIMATE.init_returnLabel#1 assume true;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; 2470#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; 2471#L40-1 assume true; 2495#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2496#L40-1 assume true; 2497#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2523#L40-1 assume true; 2444#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2445#L40-1 assume true; 2507#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 2500#L40 havoc main_~i~1#1; 2423#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2522#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2420#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); 2418#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2417#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2419#L24 assume ~n#1 < 2; 2529#merge_sortFINAL assume true; 2528#merge_sortEXIT >#52#return; 2422#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2473#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2520#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); 2461#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2519#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2617#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); 2447#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2472#merge_sortENTRY [2024-11-17 08:11:08,221 INFO L747 eck$LassoCheckResult]: Loop: 2472#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2612#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); 2448#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2472#merge_sortENTRY [2024-11-17 08:11:08,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:08,221 INFO L85 PathProgramCache]: Analyzing trace with hash 653177348, now seen corresponding path program 3 times [2024-11-17 08:11:08,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:08,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652825578] [2024-11-17 08:11:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:08,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:08,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 08:11:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652825578] [2024-11-17 08:11:08,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652825578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697592701] [2024-11-17 08:11:08,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:11:08,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:08,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:08,539 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:08,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2024-11-17 08:11:08,620 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-17 08:11:08,620 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:08,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:11:08,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 08:11:08,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-17 08:11:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697592701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:08,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:08,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 22 [2024-11-17 08:11:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303062542] [2024-11-17 08:11:08,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:08,846 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:08,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 58579, now seen corresponding path program 4 times [2024-11-17 08:11:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:08,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664796255] [2024-11-17 08:11:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:08,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:08,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:09,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:09,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 08:11:09,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-17 08:11:09,026 INFO L87 Difference]: Start difference. First operand 287 states and 367 transitions. cyclomatic complexity: 104 Second operand has 22 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 17 states have internal predecessors, (35), 9 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 08:11:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:09,500 INFO L93 Difference]: Finished difference Result 231 states and 295 transitions. [2024-11-17 08:11:09,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 295 transitions. [2024-11-17 08:11:09,503 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 104 [2024-11-17 08:11:09,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 223 states and 287 transitions. [2024-11-17 08:11:09,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 205 [2024-11-17 08:11:09,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2024-11-17 08:11:09,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 287 transitions. [2024-11-17 08:11:09,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:09,510 INFO L218 hiAutomatonCegarLoop]: Abstraction has 223 states and 287 transitions. [2024-11-17 08:11:09,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 287 transitions. [2024-11-17 08:11:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2024-11-17 08:11:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 193 states have (on average 1.238341968911917) internal successors, (239), 193 states have internal predecessors, (239), 17 states have call successors, (18), 15 states have call predecessors, (18), 10 states have return successors, (27), 11 states have call predecessors, (27), 14 states have call successors, (27) [2024-11-17 08:11:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 284 transitions. [2024-11-17 08:11:09,522 INFO L240 hiAutomatonCegarLoop]: Abstraction has 220 states and 284 transitions. [2024-11-17 08:11:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 08:11:09,523 INFO L425 stractBuchiCegarLoop]: Abstraction has 220 states and 284 transitions. [2024-11-17 08:11:09,524 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:11:09,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 220 states and 284 transitions. [2024-11-17 08:11:09,525 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 104 [2024-11-17 08:11:09,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:09,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:09,526 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:09,526 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:09,526 INFO L745 eck$LassoCheckResult]: Stem: 3184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3185#ULTIMATE.init_returnLabel#1 assume true;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; 3179#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; 3180#L40-1 assume true; 3193#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3194#L40-1 assume true; 3195#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3204#L40-1 assume true; 3205#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 3197#L40 havoc main_~i~1#1; 3160#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3251#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3249#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); 3246#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3247#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3250#L24 assume ~n#1 < 2; 3248#merge_sortFINAL assume true; 3245#merge_sortEXIT >#52#return; 3240#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3241#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3244#L24 assume ~n#1 < 2; 3243#merge_sortFINAL assume true; 3239#merge_sortEXIT >#50#return; 3238#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; 3237#L11 assume true; 3236#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 3235#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 3230#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 3228#L14 [2024-11-17 08:11:09,527 INFO L747 eck$LassoCheckResult]: Loop: 3228#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 3227#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 3226#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 3225#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 3224#L11 assume true; 3212#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 3213#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 3231#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 3228#L14 [2024-11-17 08:11:09,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1607505890, now seen corresponding path program 1 times [2024-11-17 08:11:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728122880] [2024-11-17 08:11:09,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:09,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:09,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1836357019, now seen corresponding path program 1 times [2024-11-17 08:11:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54810915] [2024-11-17 08:11:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:09,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:09,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:09,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash 125604024, now seen corresponding path program 1 times [2024-11-17 08:11:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657004411] [2024-11-17 08:11:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:09,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 08:11:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-17 08:11:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 08:11:09,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657004411] [2024-11-17 08:11:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657004411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716535766] [2024-11-17 08:11:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:09,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:09,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:09,903 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:09,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-11-17 08:11:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:09,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 08:11:09,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 08:11:10,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 08:11:10,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716535766] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:10,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:10,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 29 [2024-11-17 08:11:10,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899599763] [2024-11-17 08:11:10,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:10,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-17 08:11:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2024-11-17 08:11:10,924 INFO L87 Difference]: Start difference. First operand 220 states and 284 transitions. cyclomatic complexity: 79 Second operand has 30 states, 26 states have (on average 2.730769230769231) internal successors, (71), 24 states have internal predecessors, (71), 7 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 08:11:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:12,081 INFO L93 Difference]: Finished difference Result 568 states and 728 transitions. [2024-11-17 08:11:12,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 568 states and 728 transitions. [2024-11-17 08:11:12,087 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 279 [2024-11-17 08:11:12,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 568 states to 556 states and 713 transitions. [2024-11-17 08:11:12,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2024-11-17 08:11:12,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 540 [2024-11-17 08:11:12,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 556 states and 713 transitions. [2024-11-17 08:11:12,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:12,097 INFO L218 hiAutomatonCegarLoop]: Abstraction has 556 states and 713 transitions. [2024-11-17 08:11:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states and 713 transitions. [2024-11-17 08:11:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 307. [2024-11-17 08:11:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 276 states have (on average 1.2463768115942029) internal successors, (344), 275 states have internal predecessors, (344), 21 states have call successors, (23), 15 states have call predecessors, (23), 10 states have return successors, (40), 16 states have call predecessors, (40), 18 states have call successors, (40) [2024-11-17 08:11:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-17 08:11:12,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-17 08:11:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-17 08:11:12,112 INFO L425 stractBuchiCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-17 08:11:12,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:11:12,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 407 transitions. [2024-11-17 08:11:12,114 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 144 [2024-11-17 08:11:12,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:12,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:12,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:12,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:12,116 INFO L745 eck$LassoCheckResult]: Stem: 4299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4300#ULTIMATE.init_returnLabel#1 assume true;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; 4291#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; 4292#L40-1 assume true; 4269#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4270#L40-1 assume true; 4306#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4316#L40-1 assume true; 4317#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 4308#L40 havoc main_~i~1#1; 4253#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4264#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4323#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); 4324#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4396#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4373#L24 assume ~n#1 < 2; 4371#merge_sortFINAL assume true; 4372#merge_sortEXIT >#52#return; 4276#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4288#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4395#L24 assume ~n#1 < 2; 4394#merge_sortFINAL assume true; 4275#merge_sortEXIT >#50#return; 4273#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; 4274#L11 assume true; 4523#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 4537#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 4518#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 4519#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 4534#L13 [2024-11-17 08:11:12,116 INFO L747 eck$LassoCheckResult]: Loop: 4534#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 4533#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 4532#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 4531#L11 assume true; 4530#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 4528#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 4529#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 4535#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 4534#L13 [2024-11-17 08:11:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1706924976, now seen corresponding path program 1 times [2024-11-17 08:11:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050266567] [2024-11-17 08:11:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:12,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:12,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:12,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash 823564966, now seen corresponding path program 1 times [2024-11-17 08:11:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136180743] [2024-11-17 08:11:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:12,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:12,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:12,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1406211925, now seen corresponding path program 1 times [2024-11-17 08:11:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:12,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921001001] [2024-11-17 08:11:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:12,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 08:11:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-17 08:11:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 08:11:12,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:12,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921001001] [2024-11-17 08:11:12,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921001001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:12,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991048000] [2024-11-17 08:11:12,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:12,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:12,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:12,382 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:12,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2024-11-17 08:11:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:12,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 08:11:12,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 08:11:12,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 08:11:12,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991048000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:12,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:12,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-17 08:11:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611341455] [2024-11-17 08:11:12,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:12,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 08:11:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-17 08:11:12,914 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. cyclomatic complexity: 117 Second operand has 18 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 08:11:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:13,177 INFO L93 Difference]: Finished difference Result 368 states and 469 transitions. [2024-11-17 08:11:13,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 469 transitions. [2024-11-17 08:11:13,181 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 132 [2024-11-17 08:11:13,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 368 states and 469 transitions. [2024-11-17 08:11:13,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2024-11-17 08:11:13,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2024-11-17 08:11:13,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 469 transitions. [2024-11-17 08:11:13,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:13,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 368 states and 469 transitions. [2024-11-17 08:11:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 469 transitions. [2024-11-17 08:11:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 290. [2024-11-17 08:11:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 259 states have (on average 1.2084942084942085) internal successors, (313), 257 states have internal predecessors, (313), 21 states have call successors, (23), 15 states have call predecessors, (23), 10 states have return successors, (40), 17 states have call predecessors, (40), 18 states have call successors, (40) [2024-11-17 08:11:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 376 transitions. [2024-11-17 08:11:13,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 290 states and 376 transitions. [2024-11-17 08:11:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 08:11:13,198 INFO L425 stractBuchiCegarLoop]: Abstraction has 290 states and 376 transitions. [2024-11-17 08:11:13,198 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:11:13,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 376 transitions. [2024-11-17 08:11:13,200 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 108 [2024-11-17 08:11:13,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:13,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:13,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:13,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:11:13,201 INFO L745 eck$LassoCheckResult]: Stem: 5236#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5237#ULTIMATE.init_returnLabel#1 assume true;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; 5225#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; 5226#L40-1 assume true; 5208#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5209#L40-1 assume true; 5242#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5253#L40-1 assume true; 5206#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 5207#L40 havoc main_~i~1#1; 5190#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5318#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5316#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); 5313#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5314#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5323#L24 assume ~n#1 < 2; 5321#merge_sortFINAL assume true; 5312#merge_sortEXIT >#52#return; 5215#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5229#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5329#L24 assume ~n#1 < 2; 5217#merge_sortFINAL assume true; 5214#merge_sortEXIT >#50#return; 5216#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; 5440#L11 assume true; 5439#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 5438#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 5437#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5436#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 5187#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 5191#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 5210#L12 [2024-11-17 08:11:13,201 INFO L747 eck$LassoCheckResult]: Loop: 5210#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 5211#L11 assume true; 5238#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 5244#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 5210#L12 [2024-11-17 08:11:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -322604722, now seen corresponding path program 1 times [2024-11-17 08:11:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:13,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967016737] [2024-11-17 08:11:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:13,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:13,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:13,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1211459, now seen corresponding path program 1 times [2024-11-17 08:11:13,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:13,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850345305] [2024-11-17 08:11:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:13,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:13,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:13,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1056210704, now seen corresponding path program 1 times [2024-11-17 08:11:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:13,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126868729] [2024-11-17 08:11:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:13,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:13,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:14,736 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:14,737 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:14,737 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:14,737 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:14,737 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:14,737 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:14,737 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:14,737 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:14,737 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration13_Lasso [2024-11-17 08:11:14,737 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:14,737 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:14,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:14,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:15,674 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:15,674 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:15,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,678 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-17 08:11:15,679 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-17 08:11:15,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-11-17 08:11:15,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,714 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-17 08:11:15,715 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-17 08:11:15,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-17 08:11:15,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,739 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-17 08:11:15,741 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-17 08:11:15,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-17 08:11:15,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-11-17 08:11:15,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,765 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-17 08:11:15,766 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-17 08:11:15,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-17 08:11:15,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,789 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-17 08:11:15,790 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-17 08:11:15,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-17 08:11:15,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,814 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-17 08:11:15,814 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-17 08:11:15,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:15,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:15,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-17 08:11:15,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,842 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-17 08:11:15,843 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-17 08:11:15,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-17 08:11:15,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,865 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-17 08:11:15,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,867 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-17 08:11:15,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-17 08:11:15,868 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-17 08:11:15,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,890 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-17 08:11:15,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,891 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-17 08:11:15,892 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-17 08:11:15,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,914 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-17 08:11:15,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,916 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-17 08:11:15,917 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-17 08:11:15,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:15,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,942 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-17 08:11:15,942 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-17 08:11:15,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-11-17 08:11:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,968 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-17 08:11:15,969 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-17 08:11:15,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:15,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:15,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:15,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:15,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:15,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:15,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:15,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:15,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:15,996 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-17 08:11:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:15,998 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-17 08:11:15,999 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-17 08:11:16,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:16,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:16,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:16,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:16,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:16,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:16,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:16,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:16,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:16,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-17 08:11:16,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:16,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:16,024 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-17 08:11:16,025 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-17 08:11:16,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:16,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:16,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:16,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:16,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:16,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:16,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:16,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:16,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:16,047 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-17 08:11:16,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:16,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:16,048 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-17 08:11:16,049 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-17 08:11:16,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:16,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:16,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:16,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:16,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:16,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:16,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:16,078 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:16,088 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-17 08:11:16,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:16,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:16,089 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-17 08:11:16,090 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-17 08:11:16,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:16,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:16,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:16,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:16,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:16,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:16,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:16,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:16,170 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2024-11-17 08:11:16,170 INFO L444 ModelExtractionUtils]: 2 out of 34 variables were initially zero. Simplification set additionally 29 variables to zero. [2024-11-17 08:11:16,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:16,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:16,172 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-17 08:11:16,173 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-17 08:11:16,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:16,183 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:11:16,183 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:16,183 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_merge_~a#1.base)_1) = -4*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_merge_~a#1.base)_1 Supporting invariants [] [2024-11-17 08:11:16,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-11-17 08:11:16,226 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2024-11-17 08:11:16,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:11:16,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:11:16,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:16,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 08:11:16,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:16,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:11:16,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:16,458 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-17 08:11:16,458 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 1 loop predicates [2024-11-17 08:11:16,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 290 states and 376 transitions. cyclomatic complexity: 106 Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-17 08:11:16,693 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 290 states and 376 transitions. cyclomatic complexity: 106. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 372 states and 471 transitions. Complement of second has 22 states. [2024-11-17 08:11:16,697 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-17 08:11:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-17 08:11:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2024-11-17 08:11:16,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 31 letters. Loop has 4 letters. [2024-11-17 08:11:16,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:16,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 35 letters. Loop has 4 letters. [2024-11-17 08:11:16,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:16,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 53 transitions. Stem has 31 letters. Loop has 8 letters. [2024-11-17 08:11:16,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:16,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 471 transitions. [2024-11-17 08:11:16,704 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 108 [2024-11-17 08:11:16,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 368 states and 465 transitions. [2024-11-17 08:11:16,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 329 [2024-11-17 08:11:16,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2024-11-17 08:11:16,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 465 transitions. [2024-11-17 08:11:16,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:16,708 INFO L218 hiAutomatonCegarLoop]: Abstraction has 368 states and 465 transitions. [2024-11-17 08:11:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 465 transitions. [2024-11-17 08:11:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 350. [2024-11-17 08:11:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 319 states have (on average 1.2006269592476488) internal successors, (383), 315 states have internal predecessors, (383), 21 states have call successors, (23), 15 states have call predecessors, (23), 10 states have return successors, (40), 19 states have call predecessors, (40), 18 states have call successors, (40) [2024-11-17 08:11:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 446 transitions. [2024-11-17 08:11:16,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 350 states and 446 transitions. [2024-11-17 08:11:16,716 INFO L425 stractBuchiCegarLoop]: Abstraction has 350 states and 446 transitions. [2024-11-17 08:11:16,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-17 08:11:16,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 350 states and 446 transitions. [2024-11-17 08:11:16,718 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 108 [2024-11-17 08:11:16,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:16,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:16,719 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 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] [2024-11-17 08:11:16,719 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:16,723 INFO L745 eck$LassoCheckResult]: Stem: 6133#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6134#ULTIMATE.init_returnLabel#1 assume true;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; 6124#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; 6125#L40-1 assume true; 6104#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6105#L40-1 assume true; 6146#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6165#L40-1 assume true; 6166#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 6149#L40 havoc main_~i~1#1; 6096#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6208#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6205#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); 6198#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6201#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6207#L24 assume ~n#1 < 2; 6203#merge_sortFINAL assume true; 6197#merge_sortEXIT >#52#return; 6187#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6188#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6193#L24 assume ~n#1 < 2; 6189#merge_sortFINAL assume true; 6190#merge_sortEXIT >#50#return; 6186#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; 6265#L11 assume true; 6264#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 6263#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 6262#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6260#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 6176#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 6177#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 6170#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6107#L11 assume true; 6137#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 6212#L17-2 merge_~i~0#1 := 0; 6101#L17 [2024-11-17 08:11:16,723 INFO L747 eck$LassoCheckResult]: Loop: 6101#L17 assume true; 6100#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 6101#L17 [2024-11-17 08:11:16,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1056210671, now seen corresponding path program 1 times [2024-11-17 08:11:16,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:16,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574833949] [2024-11-17 08:11:16,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:16,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:16,830 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-17 08:11:16,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-17 08:11:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-17 08:11:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 08:11:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574833949] [2024-11-17 08:11:16,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574833949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:16,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335685151] [2024-11-17 08:11:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:16,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:16,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:16,840 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:16,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2024-11-17 08:11:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:16,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:16,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 08:11:16,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 08:11:16,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335685151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:16,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:16,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-17 08:11:16,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086277272] [2024-11-17 08:11:16,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:16,998 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:16,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 1 times [2024-11-17 08:11:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467747303] [2024-11-17 08:11:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:17,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:17,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 08:11:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-17 08:11:17,057 INFO L87 Difference]: Start difference. First operand 350 states and 446 transitions. cyclomatic complexity: 118 Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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-17 08:11:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:17,124 INFO L93 Difference]: Finished difference Result 465 states and 568 transitions. [2024-11-17 08:11:17,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 568 transitions. [2024-11-17 08:11:17,129 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 108 [2024-11-17 08:11:17,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 461 states and 564 transitions. [2024-11-17 08:11:17,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2024-11-17 08:11:17,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2024-11-17 08:11:17,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 564 transitions. [2024-11-17 08:11:17,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:17,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 461 states and 564 transitions. [2024-11-17 08:11:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 564 transitions. [2024-11-17 08:11:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 394. [2024-11-17 08:11:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 363 states have (on average 1.1570247933884297) internal successors, (420), 359 states have internal predecessors, (420), 21 states have call successors, (23), 15 states have call predecessors, (23), 10 states have return successors, (40), 19 states have call predecessors, (40), 18 states have call successors, (40) [2024-11-17 08:11:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 483 transitions. [2024-11-17 08:11:17,143 INFO L240 hiAutomatonCegarLoop]: Abstraction has 394 states and 483 transitions. [2024-11-17 08:11:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:11:17,145 INFO L425 stractBuchiCegarLoop]: Abstraction has 394 states and 483 transitions. [2024-11-17 08:11:17,145 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-17 08:11:17,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 483 transitions. [2024-11-17 08:11:17,147 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 108 [2024-11-17 08:11:17,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:17,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:17,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 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-17 08:11:17,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:17,151 INFO L745 eck$LassoCheckResult]: Stem: 7170#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7171#ULTIMATE.init_returnLabel#1 assume true;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; 7162#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; 7163#L40-1 assume true; 7143#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7144#L40-1 assume true; 7180#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7199#L40-1 assume true; 7200#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 7185#L40 havoc main_~i~1#1; 7135#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 7238#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7235#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); 7228#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7231#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7237#L24 assume ~n#1 < 2; 7233#merge_sortFINAL assume true; 7227#merge_sortEXIT >#52#return; 7214#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 7215#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7220#L24 assume ~n#1 < 2; 7221#merge_sortFINAL assume true; 7213#merge_sortEXIT >#50#return; 7212#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; 7211#L11 assume true; 7210#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 7209#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 7208#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 7206#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 7207#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 7257#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 7252#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 7148#L11 assume true; 7134#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 7137#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 7188#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 7376#L11 assume true; 7245#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 7244#L17-2 merge_~i~0#1 := 0; 7140#L17 [2024-11-17 08:11:17,151 INFO L747 eck$LassoCheckResult]: Loop: 7140#L17 assume true; 7139#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 7140#L17 [2024-11-17 08:11:17,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1551705167, now seen corresponding path program 1 times [2024-11-17 08:11:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111785810] [2024-11-17 08:11:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:17,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:17,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:17,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:17,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 2 times [2024-11-17 08:11:17,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:17,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072430847] [2024-11-17 08:11:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:17,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:17,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:17,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -835013584, now seen corresponding path program 1 times [2024-11-17 08:11:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954406599] [2024-11-17 08:11:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:17,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:17,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:18,768 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:18,768 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:18,768 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:18,768 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:18,768 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:18,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:18,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:18,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:18,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration15_Lasso [2024-11-17 08:11:18,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:18,768 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:18,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:18,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:18,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:18,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:18,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:18,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:19,794 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:19,794 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:19,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:19,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:19,796 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-17 08:11:19,797 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-17 08:11:19,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:19,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:19,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:19,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:19,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:19,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:19,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:19,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:19,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:19,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-17 08:11:19,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:19,821 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-17 08:11:19,822 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-17 08:11:19,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:19,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:19,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:19,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:19,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:19,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:19,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:19,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:19,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:19,844 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-17 08:11:19,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:19,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:19,846 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:19,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2024-11-17 08:11:19,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:19,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:19,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:19,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:19,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:19,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:19,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:19,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:19,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:19,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:19,872 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:19,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2024-11-17 08:11:19,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:19,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:19,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:19,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:19,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:19,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:19,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:19,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:19,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:19,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2024-11-17 08:11:19,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:19,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:19,896 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-17 08:11:19,897 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-17 08:11:19,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:19,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:19,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:19,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:19,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:19,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:19,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:19,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:19,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:19,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-17 08:11:19,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:19,921 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-17 08:11:19,921 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-17 08:11:19,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-17 08:11:19,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:19,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:19,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:19,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:19,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:19,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:19,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:19,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:19,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-17 08:11:19,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:19,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:19,946 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-17 08:11:19,948 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-17 08:11:19,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:19,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:19,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:19,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:19,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:19,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:19,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:19,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:19,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:19,971 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-17 08:11:19,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:19,973 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-17 08:11:19,974 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-17 08:11:19,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:19,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:19,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:19,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:19,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:19,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:19,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:19,991 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:20,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-17 08:11:20,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:20,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:20,003 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-17 08:11:20,004 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-17 08:11:20,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:20,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:20,015 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-17 08:11:20,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:20,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:20,020 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:11:20,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:20,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:20,038 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-17 08:11:20,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:20,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:20,039 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-17 08:11:20,040 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-17 08:11:20,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-17 08:11:20,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:20,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:20,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:20,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:20,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:20,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:20,070 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:20,129 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2024-11-17 08:11:20,129 INFO L444 ModelExtractionUtils]: 5 out of 31 variables were initially zero. Simplification set additionally 22 variables to zero. [2024-11-17 08:11:20,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:20,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:20,132 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-17 08:11:20,133 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-17 08:11:20,135 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:20,152 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:11:20,152 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:20,152 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_merge_~x~0#1.base)_2) = -2*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_2 Supporting invariants [1*merge_sort_merge_~x~0#1.offset >= 0] [2024-11-17 08:11:20,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-11-17 08:11:20,192 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2024-11-17 08:11:20,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:11:20,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:11:20,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:20,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:11:20,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:20,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:20,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:20,441 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-17 08:11:20,441 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2024-11-17 08:11:20,441 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 394 states and 483 transitions. cyclomatic complexity: 111 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, (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-17 08:11:20,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 394 states and 483 transitions. cyclomatic complexity: 111. 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, (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 429 states and 522 transitions. Complement of second has 12 states. [2024-11-17 08:11:20,513 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-17 08:11:20,513 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, (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-17 08:11:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2024-11-17 08:11:20,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 39 letters. Loop has 2 letters. [2024-11-17 08:11:20,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:20,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 41 letters. Loop has 2 letters. [2024-11-17 08:11:20,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:20,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 39 letters. Loop has 4 letters. [2024-11-17 08:11:20,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:20,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 522 transitions. [2024-11-17 08:11:20,518 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 112 [2024-11-17 08:11:20,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 378 states and 464 transitions. [2024-11-17 08:11:20,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 351 [2024-11-17 08:11:20,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2024-11-17 08:11:20,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 378 states and 464 transitions. [2024-11-17 08:11:20,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:20,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 378 states and 464 transitions. [2024-11-17 08:11:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states and 464 transitions. [2024-11-17 08:11:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2024-11-17 08:11:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 351 states have (on average 1.1595441595441596) internal successors, (407), 346 states have internal predecessors, (407), 18 states have call successors, (19), 12 states have call predecessors, (19), 8 states have return successors, (37), 18 states have call predecessors, (37), 16 states have call successors, (37) [2024-11-17 08:11:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 463 transitions. [2024-11-17 08:11:20,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 377 states and 463 transitions. [2024-11-17 08:11:20,529 INFO L425 stractBuchiCegarLoop]: Abstraction has 377 states and 463 transitions. [2024-11-17 08:11:20,530 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-17 08:11:20,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 377 states and 463 transitions. [2024-11-17 08:11:20,532 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 112 [2024-11-17 08:11:20,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:20,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:20,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:20,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:11:20,533 INFO L745 eck$LassoCheckResult]: Stem: 8209#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8210#ULTIMATE.init_returnLabel#1 assume true;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; 8201#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; 8202#L40-1 assume true; 8181#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8182#L40-1 assume true; 8225#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8265#L40-1 assume true; 8263#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8257#L40-1 assume true; 8179#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 8180#L40 havoc main_~i~1#1; 8171#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 8172#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8271#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); 8268#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8270#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8163#L24 assume ~n#1 < 2; 8269#merge_sortFINAL assume true; 8267#merge_sortEXIT >#52#return; 8177#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 8260#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8310#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); 8305#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8306#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8309#L24 assume ~n#1 < 2; 8308#merge_sortFINAL assume true; 8304#merge_sortEXIT >#52#return; 8300#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 8301#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8307#L24 assume ~n#1 < 2; 8303#merge_sortFINAL assume true; 8299#merge_sortEXIT >#50#return; 8297#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; 8296#L11 assume true; 8295#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 8294#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 8292#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 8289#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 8287#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 8285#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 8281#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8280#L11 assume true; 8279#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 8272#L12-2 [2024-11-17 08:11:20,533 INFO L747 eck$LassoCheckResult]: Loop: 8272#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 8273#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8244#L11 assume true; 8245#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 8272#L12-2 [2024-11-17 08:11:20,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash -363710703, now seen corresponding path program 2 times [2024-11-17 08:11:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:20,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246665930] [2024-11-17 08:11:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:20,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:20,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:20,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1230719, now seen corresponding path program 2 times [2024-11-17 08:11:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:20,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451198858] [2024-11-17 08:11:20,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:20,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:20,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:20,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:20,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2035480207, now seen corresponding path program 2 times [2024-11-17 08:11:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:20,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290730437] [2024-11-17 08:11:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:20,829 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-17 08:11:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 08:11:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:21,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-17 08:11:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:21,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-17 08:11:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 08:11:21,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290730437] [2024-11-17 08:11:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290730437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693699785] [2024-11-17 08:11:21,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:11:21,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:21,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:21,135 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:21,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2024-11-17 08:11:21,241 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:11:21,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:21,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:11:21,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-17 08:11:21,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:11:21,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693699785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:11:21,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:11:21,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2024-11-17 08:11:21,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222725598] [2024-11-17 08:11:21,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:11:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:21,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 08:11:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2024-11-17 08:11:21,474 INFO L87 Difference]: Start difference. First operand 377 states and 463 transitions. cyclomatic complexity: 109 Second operand has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 08:11:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:21,571 INFO L93 Difference]: Finished difference Result 379 states and 462 transitions. [2024-11-17 08:11:21,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 462 transitions. [2024-11-17 08:11:21,574 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 104 [2024-11-17 08:11:21,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 371 states and 453 transitions. [2024-11-17 08:11:21,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2024-11-17 08:11:21,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2024-11-17 08:11:21,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 453 transitions. [2024-11-17 08:11:21,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:21,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 371 states and 453 transitions. [2024-11-17 08:11:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 453 transitions. [2024-11-17 08:11:21,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 347. [2024-11-17 08:11:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 321 states have (on average 1.158878504672897) internal successors, (372), 317 states have internal predecessors, (372), 18 states have call successors, (19), 12 states have call predecessors, (19), 8 states have return successors, (37), 17 states have call predecessors, (37), 16 states have call successors, (37) [2024-11-17 08:11:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 428 transitions. [2024-11-17 08:11:21,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 347 states and 428 transitions. [2024-11-17 08:11:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 08:11:21,588 INFO L425 stractBuchiCegarLoop]: Abstraction has 347 states and 428 transitions. [2024-11-17 08:11:21,588 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-17 08:11:21,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 347 states and 428 transitions. [2024-11-17 08:11:21,590 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 104 [2024-11-17 08:11:21,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:21,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:21,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:21,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:21,591 INFO L745 eck$LassoCheckResult]: Stem: 9148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9149#ULTIMATE.init_returnLabel#1 assume true;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; 9140#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; 9141#L40-1 assume true; 9123#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9124#L40-1 assume true; 9162#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9179#L40-1 assume true; 9178#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9176#L40-1 assume true; 9121#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 9122#L40 havoc main_~i~1#1; 9113#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 9114#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9217#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); 9210#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 9215#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9107#L24 assume ~n#1 < 2; 9214#merge_sortFINAL assume true; 9209#merge_sortEXIT >#52#return; 9119#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9220#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9219#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); 9212#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 9213#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9218#L24 assume ~n#1 < 2; 9216#merge_sortFINAL assume true; 9211#merge_sortEXIT >#52#return; 9205#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9206#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9223#L24 assume ~n#1 < 2; 9207#merge_sortFINAL assume true; 9208#merge_sortEXIT >#50#return; 9203#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; 9202#L11 assume true; 9201#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 9200#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 9199#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 9196#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 9194#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 9192#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 9190#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9188#L11 assume true; 9186#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 9184#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 9180#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9177#L11 assume true; 9170#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 9169#L17-2 merge_~i~0#1 := 0; 9168#L17 assume true; 9117#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 9120#L17 assume true; 9152#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 9237#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 9236#merge_returnLabel#1 assume true;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; 9137#merge_sortFINAL assume true; 9129#merge_sortEXIT >#50#return; 9136#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; 9417#L11 assume true; 9415#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 9414#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 9413#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 9410#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 9408#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 9406#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 9403#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9399#L11 assume true; 9396#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 9393#L12-2 [2024-11-17 08:11:21,593 INFO L747 eck$LassoCheckResult]: Loop: 9393#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 9391#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 9388#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 9389#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 9405#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 9402#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 9398#L11 assume true; 9395#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 9393#L12-2 [2024-11-17 08:11:21,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 17047751, now seen corresponding path program 1 times [2024-11-17 08:11:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:21,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350832147] [2024-11-17 08:11:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 08:11:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 08:11:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:21,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:21,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-17 08:11:21,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:21,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350832147] [2024-11-17 08:11:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350832147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:21,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670961110] [2024-11-17 08:11:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:21,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:21,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:21,916 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:21,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2024-11-17 08:11:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:22,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 08:11:22,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-17 08:11:22,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-17 08:11:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670961110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:22,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 26 [2024-11-17 08:11:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670124082] [2024-11-17 08:11:22,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:22,612 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:22,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -516141956, now seen corresponding path program 2 times [2024-11-17 08:11:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673315123] [2024-11-17 08:11:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:22,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:22,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:22,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:22,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:22,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 08:11:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2024-11-17 08:11:22,768 INFO L87 Difference]: Start difference. First operand 347 states and 428 transitions. cyclomatic complexity: 101 Second operand has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 22 states have internal predecessors, (98), 8 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-17 08:11:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:23,545 INFO L93 Difference]: Finished difference Result 482 states and 602 transitions. [2024-11-17 08:11:23,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 602 transitions. [2024-11-17 08:11:23,549 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 166 [2024-11-17 08:11:23,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 481 states and 601 transitions. [2024-11-17 08:11:23,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2024-11-17 08:11:23,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 463 [2024-11-17 08:11:23,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 601 transitions. [2024-11-17 08:11:23,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:23,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 481 states and 601 transitions. [2024-11-17 08:11:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 601 transitions. [2024-11-17 08:11:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 336. [2024-11-17 08:11:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 310 states have (on average 1.1612903225806452) internal successors, (360), 307 states have internal predecessors, (360), 18 states have call successors, (19), 12 states have call predecessors, (19), 8 states have return successors, (35), 16 states have call predecessors, (35), 16 states have call successors, (35) [2024-11-17 08:11:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 414 transitions. [2024-11-17 08:11:23,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 336 states and 414 transitions. [2024-11-17 08:11:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-17 08:11:23,562 INFO L425 stractBuchiCegarLoop]: Abstraction has 336 states and 414 transitions. [2024-11-17 08:11:23,562 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-17 08:11:23,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 336 states and 414 transitions. [2024-11-17 08:11:23,564 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 104 [2024-11-17 08:11:23,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:23,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:23,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:23,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:23,567 INFO L745 eck$LassoCheckResult]: Stem: 10508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10509#ULTIMATE.init_returnLabel#1 assume true;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; 10502#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; 10503#L40-1 assume true; 10519#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10520#L40-1 assume true; 10483#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10484#L40-1 assume true; 10531#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10530#L40-1 assume true; 10481#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 10482#L40 havoc main_~i~1#1; 10473#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 10474#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10572#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); 10565#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 10570#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10470#L24 assume ~n#1 < 2; 10569#merge_sortFINAL assume true; 10564#merge_sortEXIT >#52#return; 10478#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 10573#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10571#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); 10563#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 10566#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10568#L24 assume ~n#1 < 2; 10567#merge_sortFINAL assume true; 10562#merge_sortEXIT >#52#return; 10559#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 10560#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 10578#L24 assume ~n#1 < 2; 10561#merge_sortFINAL assume true; 10558#merge_sortEXIT >#50#return; 10557#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; 10556#L11 assume true; 10555#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 10554#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 10553#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 10550#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 10548#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 10546#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 10544#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 10542#L11 assume true; 10540#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 10538#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 10537#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 10536#L11 assume true; 10535#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 10534#L17-2 merge_~i~0#1 := 0; 10532#L17 assume true; 10533#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 10510#L17 assume true; 10477#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 10480#L17 assume true; 10590#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 10589#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 10588#merge_returnLabel#1 assume true;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; 10587#merge_sortFINAL assume true; 10585#merge_sortEXIT >#50#return; 10487#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; 10488#L11 assume true; 10751#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 10750#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 10748#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 10749#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 10764#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 10785#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 10783#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 10781#L11 assume true; 10779#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 10777#L12-2 [2024-11-17 08:11:23,568 INFO L747 eck$LassoCheckResult]: Loop: 10777#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 10776#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 10774#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 10775#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 10784#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 10782#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 10780#L11 assume true; 10778#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 10777#L12-2 [2024-11-17 08:11:23,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash -714635224, now seen corresponding path program 2 times [2024-11-17 08:11:23,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:23,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953952694] [2024-11-17 08:11:23,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:23,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:23,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:23,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:23,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash -516141956, now seen corresponding path program 3 times [2024-11-17 08:11:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062852629] [2024-11-17 08:11:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:23,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:23,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:23,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1359527331, now seen corresponding path program 3 times [2024-11-17 08:11:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585430784] [2024-11-17 08:11:23,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:23,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:23,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:23,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:28,298 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:28,298 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:28,298 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:28,298 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:28,298 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:28,298 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:28,298 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:28,299 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:28,299 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration18_Lasso [2024-11-17 08:11:28,299 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:28,299 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:28,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:28,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:29,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:30,267 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:30,267 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:30,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,269 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-17 08:11:30,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,271 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-17 08:11:30,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:30,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:30,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:30,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,292 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-17 08:11:30,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,294 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-17 08:11:30,294 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-17 08:11:30,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-17 08:11:30,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:30,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:30,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:30,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-11-17 08:11:30,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,317 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-17 08:11:30,318 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-17 08:11:30,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,328 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2024-11-17 08:11:30,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,334 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-11-17 08:11:30,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:30,344 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2024-11-17 08:11:30,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,355 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-17 08:11:30,356 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-17 08:11:30,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:30,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:30,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:30,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,381 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-17 08:11:30,382 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-17 08:11:30,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:30,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:30,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:30,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-11-17 08:11:30,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,406 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-17 08:11:30,407 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-17 08:11:30,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:30,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:30,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-11-17 08:11:30,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,434 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-17 08:11:30,434 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-17 08:11:30,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:30,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:30,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:30,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-11-17 08:11:30,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,457 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-17 08:11:30,458 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-17 08:11:30,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:30,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:30,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:30,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,480 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-17 08:11:30,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,481 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-17 08:11:30,482 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-17 08:11:30,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:30,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:30,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:30,498 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:30,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2024-11-17 08:11:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:30,509 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-17 08:11:30,510 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-17 08:11:30,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:30,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:30,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:30,522 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-11-17 08:11:30,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:30,597 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-11-17 08:11:30,597 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-11-17 08:11:31,181 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:31,926 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2024-11-17 08:11:31,926 INFO L444 ModelExtractionUtils]: 25 out of 136 variables were initially zero. Simplification set additionally 108 variables to zero. [2024-11-17 08:11:31,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:31,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:31,928 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-17 08:11:31,929 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-17 08:11:31,929 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:31,943 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2024-11-17 08:11:31,943 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:31,944 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~j~0#1, v_rep(select #length merge_sort_#in~a#1.base)_5) = -4*merge_sort_merge_~j~0#1 + 1*v_rep(select #length merge_sort_#in~a#1.base)_5 Supporting invariants [] [2024-11-17 08:11:31,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-11-17 08:11:32,022 INFO L156 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2024-11-17 08:11:32,026 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:11:32,026 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:11:32,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:32,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:32,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 08:11:32,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:32,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:11:32,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:32,616 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-17 08:11:32,616 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2024-11-17 08:11:32,617 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 336 states and 414 transitions. cyclomatic complexity: 98 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-17 08:11:32,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 336 states and 414 transitions. cyclomatic complexity: 98. 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 343 states and 421 transitions. Complement of second has 12 states. [2024-11-17 08:11:32,733 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-17 08:11:32,734 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-17 08:11:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2024-11-17 08:11:32,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 70 letters. Loop has 8 letters. [2024-11-17 08:11:32,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:32,734 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:11:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:32,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 08:11:32,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:33,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:11:33,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:33,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-17 08:11:33,281 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-17 08:11:33,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 336 states and 414 transitions. cyclomatic complexity: 98 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-17 08:11:33,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 336 states and 414 transitions. cyclomatic complexity: 98. 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 344 states and 422 transitions. Complement of second has 14 states. [2024-11-17 08:11:33,393 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-17 08:11:33,393 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-17 08:11:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2024-11-17 08:11:33,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 70 letters. Loop has 8 letters. [2024-11-17 08:11:33,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:33,394 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:11:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:33,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-17 08:11:33,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:33,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:11:33,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:34,014 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-17 08:11:34,014 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2024-11-17 08:11:34,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 336 states and 414 transitions. cyclomatic complexity: 98 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), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 08:11:34,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 336 states and 414 transitions. cyclomatic complexity: 98. 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), 3 states have call predecessors, (4), 2 states have call successors, (4) Result 447 states and 536 transitions. Complement of second has 23 states. [2024-11-17 08:11:34,210 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-17 08:11:34,210 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), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 08:11:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2024-11-17 08:11:34,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 66 transitions. Stem has 70 letters. Loop has 8 letters. [2024-11-17 08:11:34,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:34,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 66 transitions. Stem has 78 letters. Loop has 8 letters. [2024-11-17 08:11:34,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:34,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 66 transitions. Stem has 70 letters. Loop has 16 letters. [2024-11-17 08:11:34,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:34,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 447 states and 536 transitions. [2024-11-17 08:11:34,218 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 88 [2024-11-17 08:11:34,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 447 states to 423 states and 511 transitions. [2024-11-17 08:11:34,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2024-11-17 08:11:34,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 346 [2024-11-17 08:11:34,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 423 states and 511 transitions. [2024-11-17 08:11:34,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:34,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 423 states and 511 transitions. [2024-11-17 08:11:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states and 511 transitions. [2024-11-17 08:11:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 394. [2024-11-17 08:11:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 368 states have (on average 1.1630434782608696) internal successors, (428), 365 states have internal predecessors, (428), 18 states have call successors, (19), 12 states have call predecessors, (19), 8 states have return successors, (35), 16 states have call predecessors, (35), 16 states have call successors, (35) [2024-11-17 08:11:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 482 transitions. [2024-11-17 08:11:34,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 394 states and 482 transitions. [2024-11-17 08:11:34,233 INFO L425 stractBuchiCegarLoop]: Abstraction has 394 states and 482 transitions. [2024-11-17 08:11:34,234 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-17 08:11:34,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 394 states and 482 transitions. [2024-11-17 08:11:34,235 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 88 [2024-11-17 08:11:34,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:34,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:34,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 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] [2024-11-17 08:11:34,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:11:34,237 INFO L745 eck$LassoCheckResult]: Stem: 12891#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12892#ULTIMATE.init_returnLabel#1 assume true;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; 12883#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; 12884#L40-1 assume true; 12904#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 12905#L40-1 assume true; 12865#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 12866#L40-1 assume true; 12927#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 12924#L40-1 assume true; 12863#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 12864#L40 havoc main_~i~1#1; 12855#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 12856#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12962#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); 12956#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12960#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12844#L24 assume ~n#1 < 2; 12959#merge_sortFINAL assume true; 12955#merge_sortEXIT >#52#return; 12860#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 12963#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12961#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); 12954#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12957#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12965#L24 assume ~n#1 < 2; 12958#merge_sortFINAL assume true; 12953#merge_sortEXIT >#52#return; 12951#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 12952#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12968#L24 assume ~n#1 < 2; 12967#merge_sortFINAL assume true; 12966#merge_sortEXIT >#50#return; 12949#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; 12948#L11 assume true; 12947#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 12945#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 12943#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12941#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 12939#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 12937#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 12935#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12933#L11 assume true; 12931#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 12928#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 12919#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12918#L11 assume true; 12917#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 12916#L17-2 merge_~i~0#1 := 0; 12914#L17 assume true; 12915#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 12893#L17 assume true; 12859#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 12862#L17 assume true; 12987#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 12986#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 12985#merge_returnLabel#1 assume true;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; 12984#merge_sortFINAL assume true; 12981#merge_sortEXIT >#50#return; 12983#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; 13085#L11 assume true; 13084#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 13081#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 13082#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13207#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 13206#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 13205#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 13204#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13200#L11 assume true; 13198#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 13196#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 12911#L12 [2024-11-17 08:11:34,237 INFO L747 eck$LassoCheckResult]: Loop: 12911#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13223#L11 assume true; 13222#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 12910#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 12911#L12 [2024-11-17 08:11:34,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash -678855454, now seen corresponding path program 4 times [2024-11-17 08:11:34,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:34,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916035601] [2024-11-17 08:11:34,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 08:11:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 08:11:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:34,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-17 08:11:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916035601] [2024-11-17 08:11:34,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916035601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:34,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015214526] [2024-11-17 08:11:34,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:11:34,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:34,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:34,523 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:34,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2024-11-17 08:11:34,721 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:11:34,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:34,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 08:11:34,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-17 08:11:34,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-17 08:11:35,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015214526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:35,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 20 [2024-11-17 08:11:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99802865] [2024-11-17 08:11:35,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:35,076 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:35,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1211459, now seen corresponding path program 3 times [2024-11-17 08:11:35,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:35,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371927684] [2024-11-17 08:11:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:35,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:35,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:35,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:35,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:35,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 08:11:35,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-17 08:11:35,172 INFO L87 Difference]: Start difference. First operand 394 states and 482 transitions. cyclomatic complexity: 110 Second operand has 21 states, 20 states have (on average 4.5) internal successors, (90), 17 states have internal predecessors, (90), 6 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-17 08:11:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:35,711 INFO L93 Difference]: Finished difference Result 528 states and 631 transitions. [2024-11-17 08:11:35,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 528 states and 631 transitions. [2024-11-17 08:11:35,714 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 116 [2024-11-17 08:11:35,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 528 states to 528 states and 631 transitions. [2024-11-17 08:11:35,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 439 [2024-11-17 08:11:35,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 439 [2024-11-17 08:11:35,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 528 states and 631 transitions. [2024-11-17 08:11:35,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:35,718 INFO L218 hiAutomatonCegarLoop]: Abstraction has 528 states and 631 transitions. [2024-11-17 08:11:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states and 631 transitions. [2024-11-17 08:11:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 459. [2024-11-17 08:11:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 433 states have (on average 1.163972286374134) internal successors, (504), 428 states have internal predecessors, (504), 18 states have call successors, (19), 14 states have call predecessors, (19), 8 states have return successors, (35), 16 states have call predecessors, (35), 16 states have call successors, (35) [2024-11-17 08:11:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 558 transitions. [2024-11-17 08:11:35,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 459 states and 558 transitions. [2024-11-17 08:11:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 08:11:35,728 INFO L425 stractBuchiCegarLoop]: Abstraction has 459 states and 558 transitions. [2024-11-17 08:11:35,729 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-17 08:11:35,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 459 states and 558 transitions. [2024-11-17 08:11:35,731 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 104 [2024-11-17 08:11:35,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:35,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:35,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 4, 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, 1] [2024-11-17 08:11:35,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:35,732 INFO L745 eck$LassoCheckResult]: Stem: 14352#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14353#ULTIMATE.init_returnLabel#1 assume true;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; 14344#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; 14345#L40-1 assume true; 14368#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14369#L40-1 assume true; 14322#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14323#L40-1 assume true; 14415#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14412#L40-1 assume true; 14320#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 14321#L40 havoc main_~i~1#1; 14303#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 14313#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14428#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); 14421#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 14425#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14301#L24 assume ~n#1 < 2; 14424#merge_sortFINAL assume true; 14420#merge_sortEXIT >#52#return; 14317#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 14431#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14426#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); 14419#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 14422#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14427#L24 assume ~n#1 < 2; 14423#merge_sortFINAL assume true; 14418#merge_sortEXIT >#52#return; 14406#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 14407#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14429#L24 assume ~n#1 < 2; 14430#merge_sortFINAL assume true; 14405#merge_sortEXIT >#50#return; 14404#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; 14403#L11 assume true; 14402#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14399#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 14397#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 14395#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 14393#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 14391#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 14389#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14387#L11 assume true; 14385#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14383#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 14382#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14381#L11 assume true; 14380#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 14379#L17-2 merge_~i~0#1 := 0; 14377#L17 assume true; 14378#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 14354#L17 assume true; 14316#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 14319#L17 assume true; 14451#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 14450#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 14449#merge_returnLabel#1 assume true;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; 14448#merge_sortFINAL assume true; 14332#merge_sortEXIT >#50#return; 14339#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; 14560#L11 assume true; 14556#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14557#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 14677#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 14678#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 14669#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 14670#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 14706#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14705#L11 assume true; 14702#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14703#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 14370#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 14305#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 14360#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14704#L11 assume true; 14701#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 14359#L17-2 merge_~i~0#1 := 0; 14315#L17 [2024-11-17 08:11:35,732 INFO L747 eck$LassoCheckResult]: Loop: 14315#L17 assume true; 14314#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 14315#L17 [2024-11-17 08:11:35,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash -89850038, now seen corresponding path program 1 times [2024-11-17 08:11:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:35,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732455949] [2024-11-17 08:11:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:35,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 08:11:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 08:11:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 08:11:36,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:36,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732455949] [2024-11-17 08:11:36,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732455949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:36,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732923493] [2024-11-17 08:11:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:36,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:36,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:36,008 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:36,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2024-11-17 08:11:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:11:36,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 40 proven. 26 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 08:11:36,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 40 proven. 26 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 08:11:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732923493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:36,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:36,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 17 [2024-11-17 08:11:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651421146] [2024-11-17 08:11:36,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:36,379 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:36,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 3 times [2024-11-17 08:11:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736400659] [2024-11-17 08:11:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:36,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:36,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 08:11:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-17 08:11:36,440 INFO L87 Difference]: Start difference. First operand 459 states and 558 transitions. cyclomatic complexity: 123 Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 15 states have internal predecessors, (83), 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-17 08:11:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:36,631 INFO L93 Difference]: Finished difference Result 566 states and 677 transitions. [2024-11-17 08:11:36,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 566 states and 677 transitions. [2024-11-17 08:11:36,634 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 104 [2024-11-17 08:11:36,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 566 states to 566 states and 677 transitions. [2024-11-17 08:11:36,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 469 [2024-11-17 08:11:36,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 469 [2024-11-17 08:11:36,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 566 states and 677 transitions. [2024-11-17 08:11:36,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:36,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 566 states and 677 transitions. [2024-11-17 08:11:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states and 677 transitions. [2024-11-17 08:11:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 505. [2024-11-17 08:11:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 479 states have (on average 1.1565762004175366) internal successors, (554), 474 states have internal predecessors, (554), 18 states have call successors, (19), 14 states have call predecessors, (19), 8 states have return successors, (35), 16 states have call predecessors, (35), 16 states have call successors, (35) [2024-11-17 08:11:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 608 transitions. [2024-11-17 08:11:36,648 INFO L240 hiAutomatonCegarLoop]: Abstraction has 505 states and 608 transitions. [2024-11-17 08:11:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 08:11:36,650 INFO L425 stractBuchiCegarLoop]: Abstraction has 505 states and 608 transitions. [2024-11-17 08:11:36,651 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-17 08:11:36,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 505 states and 608 transitions. [2024-11-17 08:11:36,653 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 104 [2024-11-17 08:11:36,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:36,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:36,653 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:36,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:11:36,654 INFO L745 eck$LassoCheckResult]: Stem: 15925#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15926#ULTIMATE.init_returnLabel#1 assume true;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; 15917#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; 15918#L40-1 assume true; 15893#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 15894#L40-1 assume true; 15938#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 15958#L40-1 assume true; 15956#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 15952#L40-1 assume true; 15891#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 15892#L40 havoc main_~i~1#1; 15882#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 15884#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16000#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); 15991#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 15995#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 15878#L24 assume ~n#1 < 2; 15994#merge_sortFINAL assume true; 15990#merge_sortEXIT >#52#return; 15888#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 15997#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 15996#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); 15989#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 15992#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 15999#L24 assume ~n#1 < 2; 15993#merge_sortFINAL assume true; 15988#merge_sortEXIT >#52#return; 15984#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 15985#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16002#L24 assume ~n#1 < 2; 15986#merge_sortFINAL assume true; 15987#merge_sortEXIT >#50#return; 15982#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; 15981#L11 assume true; 15980#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 15977#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 15975#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 15973#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 15971#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 15969#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 15967#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 15965#L11 assume true; 15963#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 15961#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 15960#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 15959#L11 assume true; 15957#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 15955#L17-2 merge_~i~0#1 := 0; 15950#L17 assume true; 15951#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 15929#L17 assume true; 15887#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 15890#L17 assume true; 16011#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 16025#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 16024#merge_returnLabel#1 assume true;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; 16023#merge_sortFINAL assume true; 16014#merge_sortEXIT >#50#return; 15899#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; 15900#L11 assume true; 16230#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 16231#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 16262#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 16260#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 16258#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 16256#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 16254#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 16252#L11 assume true; 16250#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 16248#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 16240#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 16241#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 16268#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 16267#L11 assume true; 16265#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 16264#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 15939#L13-1 [2024-11-17 08:11:36,654 INFO L747 eck$LassoCheckResult]: Loop: 15939#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 15940#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 16282#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 16280#L11 assume true; 16281#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 16343#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 15939#L13-1 [2024-11-17 08:11:36,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash -89849998, now seen corresponding path program 2 times [2024-11-17 08:11:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:36,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066248285] [2024-11-17 08:11:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:36,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:36,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:36,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1241500169, now seen corresponding path program 1 times [2024-11-17 08:11:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241851348] [2024-11-17 08:11:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:36,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:36,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1749659834, now seen corresponding path program 3 times [2024-11-17 08:11:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:36,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457522415] [2024-11-17 08:11:36,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-17 08:11:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 08:11:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 60 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 08:11:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457522415] [2024-11-17 08:11:36,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457522415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760227157] [2024-11-17 08:11:36,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:11:36,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:36,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:36,996 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:36,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2024-11-17 08:11:37,182 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-17 08:11:37,182 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:37,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:11:37,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 22 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 08:11:37,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 22 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 08:11:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760227157] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:37,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 20 [2024-11-17 08:11:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110578604] [2024-11-17 08:11:37,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 08:11:37,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-17 08:11:37,621 INFO L87 Difference]: Start difference. First operand 505 states and 608 transitions. cyclomatic complexity: 127 Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 18 states have internal predecessors, (95), 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-17 08:11:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:37,836 INFO L93 Difference]: Finished difference Result 579 states and 687 transitions. [2024-11-17 08:11:37,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 579 states and 687 transitions. [2024-11-17 08:11:37,839 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 106 [2024-11-17 08:11:37,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 579 states to 575 states and 683 transitions. [2024-11-17 08:11:37,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 478 [2024-11-17 08:11:37,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 497 [2024-11-17 08:11:37,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 575 states and 683 transitions. [2024-11-17 08:11:37,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:37,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 575 states and 683 transitions. [2024-11-17 08:11:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states and 683 transitions. [2024-11-17 08:11:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 563. [2024-11-17 08:11:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 536 states have (on average 1.1473880597014925) internal successors, (615), 530 states have internal predecessors, (615), 19 states have call successors, (20), 14 states have call predecessors, (20), 8 states have return successors, (36), 18 states have call predecessors, (36), 17 states have call successors, (36) [2024-11-17 08:11:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 671 transitions. [2024-11-17 08:11:37,853 INFO L240 hiAutomatonCegarLoop]: Abstraction has 563 states and 671 transitions. [2024-11-17 08:11:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 08:11:37,854 INFO L425 stractBuchiCegarLoop]: Abstraction has 563 states and 671 transitions. [2024-11-17 08:11:37,854 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-17 08:11:37,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 563 states and 671 transitions. [2024-11-17 08:11:37,857 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 104 [2024-11-17 08:11:37,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:37,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:37,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:37,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:37,858 INFO L745 eck$LassoCheckResult]: Stem: 17592#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17593#ULTIMATE.init_returnLabel#1 assume true;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; 17585#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; 17586#L40-1 assume true; 17603#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17604#L40-1 assume true; 17564#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17565#L40-1 assume true; 17649#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 17646#L40-1 assume true; 17562#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 17563#L40 havoc main_~i~1#1; 17534#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 17554#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17663#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); 17655#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 17659#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17549#L24 assume ~n#1 < 2; 17658#merge_sortFINAL assume true; 17654#merge_sortEXIT >#52#return; 17560#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 17662#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17661#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); 17653#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 17656#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17660#L24 assume ~n#1 < 2; 17657#merge_sortFINAL assume true; 17652#merge_sortEXIT >#52#return; 17641#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 17642#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 17665#L24 assume ~n#1 < 2; 17666#merge_sortFINAL assume true; 17640#merge_sortEXIT >#50#return; 17639#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; 17638#L11 assume true; 17637#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 17634#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 17632#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 17630#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 17628#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 17626#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 17624#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17622#L11 assume true; 17620#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 17618#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 17617#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17616#L11 assume true; 17615#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 17614#L17-2 merge_~i~0#1 := 0; 17612#L17 assume true; 17613#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 17594#L17 assume true; 17557#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 17561#L17 assume true; 17675#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 17583#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 17584#merge_returnLabel#1 assume true;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; 17688#merge_sortFINAL assume true; 17679#merge_sortEXIT >#50#return; 17570#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; 17571#L11 assume true; 17935#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 17933#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 17932#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 17931#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 17929#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 17928#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 17927#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17926#L11 assume true; 17925#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 17924#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 17923#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 17922#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 17920#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 17921#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 17953#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17952#L11 assume true; 17951#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 17906#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 17905#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 17904#L11 assume true; 17733#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 17597#L17-2 merge_~i~0#1 := 0; 17556#L17 [2024-11-17 08:11:37,858 INFO L747 eck$LassoCheckResult]: Loop: 17556#L17 assume true; 17555#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 17556#L17 [2024-11-17 08:11:37,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:37,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1365467160, now seen corresponding path program 5 times [2024-11-17 08:11:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470128522] [2024-11-17 08:11:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:37,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:37,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:37,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:37,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 4 times [2024-11-17 08:11:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:37,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141088889] [2024-11-17 08:11:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:37,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:37,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:37,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2046052007, now seen corresponding path program 6 times [2024-11-17 08:11:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:37,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394908994] [2024-11-17 08:11:37,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:38,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:38,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:50,442 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:50,442 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:50,442 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:50,442 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:50,442 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:50,442 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:50,443 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:50,443 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:50,443 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration22_Lasso [2024-11-17 08:11:50,443 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:50,443 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:50,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:51,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:52,392 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:52,392 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:52,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:52,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:52,394 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-17 08:11:52,395 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-17 08:11:52,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:52,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:52,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:52,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:52,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:52,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:52,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:52,413 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:52,424 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-17 08:11:52,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:52,426 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-17 08:11:52,426 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-17 08:11:52,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:52,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:52,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:52,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:52,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:52,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:52,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:52,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:52,439 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:52,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-11-17 08:11:52,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:52,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:52,450 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-17 08:11:52,450 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-17 08:11:52,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:52,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:52,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:52,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:52,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:52,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:52,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:52,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:52,511 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-11-17 08:11:52,511 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 17 variables to zero. [2024-11-17 08:11:52,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:52,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:52,514 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-17 08:11:52,515 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-17 08:11:52,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:52,532 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:11:52,532 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:52,533 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_#in~a#1.base)_6) = -8*merge_sort_merge_~i~0#1 + 5*v_rep(select #length merge_sort_#in~a#1.base)_6 Supporting invariants [] [2024-11-17 08:11:52,548 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-17 08:11:52,606 INFO L156 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2024-11-17 08:11:52,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:11:52,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:11:52,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:52,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 08:11:52,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:53,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:11:53,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:53,424 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-17 08:11:53,424 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.16 stem predicates 1 loop predicates [2024-11-17 08:11:53,424 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 563 states and 671 transitions. cyclomatic complexity: 132 Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 08:11:53,744 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 563 states and 671 transitions. cyclomatic complexity: 132. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Result 628 states and 747 transitions. Complement of second has 21 states. [2024-11-17 08:11:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 12 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-17 08:11:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 08:11:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2024-11-17 08:11:53,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 41 transitions. Stem has 83 letters. Loop has 2 letters. [2024-11-17 08:11:53,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:53,745 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:11:53,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:53,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-17 08:11:53,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:54,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:11:54,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:54,340 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-17 08:11:54,340 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 1 loop predicates [2024-11-17 08:11:54,340 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 563 states and 671 transitions. cyclomatic complexity: 132 Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 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-17 08:11:54,529 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 563 states and 671 transitions. cyclomatic complexity: 132. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 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 598 states and 708 transitions. Complement of second has 17 states. [2024-11-17 08:11:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 10 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-17 08:11:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 12 states have internal predecessors, (50), 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-17 08:11:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2024-11-17 08:11:54,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 46 transitions. Stem has 83 letters. Loop has 2 letters. [2024-11-17 08:11:54,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:54,530 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:11:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:54,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-17 08:11:54,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:54,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2024-11-17 08:11:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:55,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:11:55,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:55,325 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-17 08:11:55,326 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.16 stem predicates 1 loop predicates [2024-11-17 08:11:55,326 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 563 states and 671 transitions. cyclomatic complexity: 132 Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 08:11:55,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 563 states and 671 transitions. cyclomatic complexity: 132. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Result 915 states and 1090 transitions. Complement of second has 31 states. [2024-11-17 08:11:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 15 stem states 1 non-accepting loop states 2 accepting loop states [2024-11-17 08:11:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 08:11:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2024-11-17 08:11:55,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 120 transitions. Stem has 83 letters. Loop has 2 letters. [2024-11-17 08:11:55,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:55,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 120 transitions. Stem has 85 letters. Loop has 2 letters. [2024-11-17 08:11:55,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:55,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 120 transitions. Stem has 83 letters. Loop has 4 letters. [2024-11-17 08:11:55,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:55,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 915 states and 1090 transitions. [2024-11-17 08:11:55,936 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 171 [2024-11-17 08:11:55,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 915 states to 827 states and 987 transitions. [2024-11-17 08:11:55,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 710 [2024-11-17 08:11:55,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 717 [2024-11-17 08:11:55,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 827 states and 987 transitions. [2024-11-17 08:11:55,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:55,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 827 states and 987 transitions. [2024-11-17 08:11:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states and 987 transitions. [2024-11-17 08:11:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 805. [2024-11-17 08:11:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 767 states have (on average 1.1486310299869622) internal successors, (881), 763 states have internal predecessors, (881), 25 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (56), 27 states have call predecessors, (56), 24 states have call successors, (56) [2024-11-17 08:11:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 964 transitions. [2024-11-17 08:11:55,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 805 states and 964 transitions. [2024-11-17 08:11:55,959 INFO L425 stractBuchiCegarLoop]: Abstraction has 805 states and 964 transitions. [2024-11-17 08:11:55,959 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2024-11-17 08:11:55,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 805 states and 964 transitions. [2024-11-17 08:11:55,963 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 171 [2024-11-17 08:11:55,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:55,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:55,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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-17 08:11:55,965 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:11:55,965 INFO L745 eck$LassoCheckResult]: Stem: 21312#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 21313#ULTIMATE.init_returnLabel#1 assume true;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; 21306#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; 21307#L40-1 assume true; 21321#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 21322#L40-1 assume true; 21279#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 21280#L40-1 assume true; 21330#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 21329#L40-1 assume true; 21328#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 21327#L40-1 assume true; 21277#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 21278#L40 havoc main_~i~1#1; 21253#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 21272#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21331#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); 21265#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 21264#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21267#L24 assume ~n#1 < 2; 21393#merge_sortFINAL assume true; 21392#merge_sortEXIT >#52#return; 21289#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 21389#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21388#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); 21379#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 21382#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21386#L24 assume ~n#1 < 2; 21384#merge_sortFINAL assume true; 21378#merge_sortEXIT >#52#return; 21370#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 21371#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21377#L24 assume ~n#1 < 2; 21372#merge_sortFINAL assume true; 21374#merge_sortEXIT >#50#return; 21394#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; 21363#L11 assume true; 21360#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 21356#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 21352#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 21353#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 21524#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 21522#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 21520#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 21518#L11 assume true; 21516#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 21513#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 21512#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 21511#L11 assume true; 21510#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 21508#L17-2 merge_~i~0#1 := 0; 21506#L17 assume true; 21502#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 21499#L17 assume true; 21494#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 21493#L17 assume true; 21459#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 21456#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 21457#merge_returnLabel#1 assume true;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; 21471#merge_sortFINAL assume true; 21288#merge_sortEXIT >#50#return; 21290#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; 21826#L11 assume true; 21827#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 21821#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 21822#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 22054#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 22053#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 22052#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 22051#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22050#L11 assume true; 22049#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 22048#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 21323#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 21254#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 22056#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22055#L11 assume true; 21268#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 21269#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 22032#L13-1 [2024-11-17 08:11:55,966 INFO L747 eck$LassoCheckResult]: Loop: 22032#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 22046#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 22044#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22042#L11 assume true; 22040#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 22036#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 22032#L13-1 [2024-11-17 08:11:55,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1414718033, now seen corresponding path program 4 times [2024-11-17 08:11:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:55,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412158055] [2024-11-17 08:11:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 08:11:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:56,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-17 08:11:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:56,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 41 proven. 30 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-17 08:11:56,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:56,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412158055] [2024-11-17 08:11:56,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412158055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318719924] [2024-11-17 08:11:56,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:11:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:56,397 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:56,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2024-11-17 08:11:56,613 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:11:56,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:56,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:11:56,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 24 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-17 08:11:56,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 27 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-17 08:11:57,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318719924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:57,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:57,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 23 [2024-11-17 08:11:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414251655] [2024-11-17 08:11:57,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:57,033 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:57,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:57,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1241500169, now seen corresponding path program 2 times [2024-11-17 08:11:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:57,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041113368] [2024-11-17 08:11:57,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:57,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:57,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 08:11:57,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-17 08:11:57,112 INFO L87 Difference]: Start difference. First operand 805 states and 964 transitions. cyclomatic complexity: 199 Second operand has 23 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 15 states have internal predecessors, (59), 10 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-17 08:11:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:57,421 INFO L93 Difference]: Finished difference Result 784 states and 947 transitions. [2024-11-17 08:11:57,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 784 states and 947 transitions. [2024-11-17 08:11:57,426 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 173 [2024-11-17 08:11:57,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 784 states to 740 states and 899 transitions. [2024-11-17 08:11:57,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 652 [2024-11-17 08:11:57,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 652 [2024-11-17 08:11:57,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 740 states and 899 transitions. [2024-11-17 08:11:57,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:57,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 740 states and 899 transitions. [2024-11-17 08:11:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states and 899 transitions. [2024-11-17 08:11:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 709. [2024-11-17 08:11:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 676 states have (on average 1.1568047337278107) internal successors, (782), 672 states have internal predecessors, (782), 22 states have call successors, (24), 13 states have call predecessors, (24), 11 states have return successors, (52), 23 states have call predecessors, (52), 21 states have call successors, (52) [2024-11-17 08:11:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 858 transitions. [2024-11-17 08:11:57,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 709 states and 858 transitions. [2024-11-17 08:11:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 08:11:57,446 INFO L425 stractBuchiCegarLoop]: Abstraction has 709 states and 858 transitions. [2024-11-17 08:11:57,446 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2024-11-17 08:11:57,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 709 states and 858 transitions. [2024-11-17 08:11:57,449 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 161 [2024-11-17 08:11:57,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:57,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:57,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:57,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:11:57,451 INFO L745 eck$LassoCheckResult]: Stem: 23469#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 23470#ULTIMATE.init_returnLabel#1 assume true;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; 23463#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; 23464#L40-1 assume true; 23479#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 23480#L40-1 assume true; 23444#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 23445#L40-1 assume true; 23491#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 23490#L40-1 assume true; 23489#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 23488#L40-1 assume true; 23442#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 23443#L40 havoc main_~i~1#1; 23434#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 23435#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23492#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); 23416#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23415#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23417#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); 23422#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23541#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23547#L24 assume ~n#1 < 2; 23546#merge_sortFINAL assume true; 23539#merge_sortEXIT >#52#return; 23439#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 23545#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23543#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); 23538#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23540#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23544#L24 assume ~n#1 < 2; 23542#merge_sortFINAL assume true; 23537#merge_sortEXIT >#52#return; 23529#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 23530#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23533#L24 assume ~n#1 < 2; 23534#merge_sortFINAL assume true; 23528#merge_sortEXIT >#50#return; 23527#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; 23526#L11 assume true; 23524#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 23521#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 23518#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 23516#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 23514#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 23512#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 23510#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 23508#L11 assume true; 23504#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 23505#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 23499#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 23500#L11 assume true; 23584#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 23583#L17-2 merge_~i~0#1 := 0; 23493#L17 assume true; 23494#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 23473#L17 assume true; 23438#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 23441#L17 assume true; 23590#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 23588#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 23586#merge_returnLabel#1 assume true;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; 23585#merge_sortFINAL assume true; 23578#merge_sortEXIT >#50#return; 23579#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; 23747#L11 assume true; 23746#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 23743#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 23740#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 23738#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 23736#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 23734#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 23732#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 23730#L11 assume true; 23728#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 23726#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 23724#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 23723#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 23722#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 23721#L11 assume true; 23707#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 23708#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 23748#L13-1 [2024-11-17 08:11:57,451 INFO L747 eck$LassoCheckResult]: Loop: 23748#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 23718#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 23719#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 23760#L11 assume true; 23755#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 23752#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 23748#L13-1 [2024-11-17 08:11:57,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash 103050291, now seen corresponding path program 5 times [2024-11-17 08:11:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:57,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050858612] [2024-11-17 08:11:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:57,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 08:11:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-17 08:11:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:57,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 45 proven. 41 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-17 08:11:57,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050858612] [2024-11-17 08:11:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050858612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408027904] [2024-11-17 08:11:57,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:11:57,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:57,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:57,912 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:57,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2024-11-17 08:11:58,155 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-17 08:11:58,155 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:58,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 08:11:58,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 32 proven. 66 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-17 08:11:58,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 32 proven. 66 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-17 08:11:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408027904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:58,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:58,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 30 [2024-11-17 08:11:58,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596847148] [2024-11-17 08:11:58,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:58,602 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1241500169, now seen corresponding path program 3 times [2024-11-17 08:11:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:58,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065264235] [2024-11-17 08:11:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:58,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:58,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:58,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:58,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-17 08:11:58,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2024-11-17 08:11:58,686 INFO L87 Difference]: Start difference. First operand 709 states and 858 transitions. cyclomatic complexity: 185 Second operand has 30 states, 28 states have (on average 3.357142857142857) internal successors, (94), 25 states have internal predecessors, (94), 7 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-17 08:11:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:59,276 INFO L93 Difference]: Finished difference Result 1167 states and 1400 transitions. [2024-11-17 08:11:59,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1167 states and 1400 transitions. [2024-11-17 08:11:59,283 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 275 [2024-11-17 08:11:59,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1167 states to 1116 states and 1341 transitions. [2024-11-17 08:11:59,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 974 [2024-11-17 08:11:59,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 982 [2024-11-17 08:11:59,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1116 states and 1341 transitions. [2024-11-17 08:11:59,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:59,289 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1116 states and 1341 transitions. [2024-11-17 08:11:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states and 1341 transitions. [2024-11-17 08:11:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 760. [2024-11-17 08:11:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 722 states have (on average 1.1523545706371192) internal successors, (832), 718 states have internal predecessors, (832), 26 states have call successors, (28), 16 states have call predecessors, (28), 12 states have return successors, (55), 25 states have call predecessors, (55), 24 states have call successors, (55) [2024-11-17 08:11:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 915 transitions. [2024-11-17 08:11:59,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 760 states and 915 transitions. [2024-11-17 08:11:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-17 08:11:59,307 INFO L425 stractBuchiCegarLoop]: Abstraction has 760 states and 915 transitions. [2024-11-17 08:11:59,307 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2024-11-17 08:11:59,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 760 states and 915 transitions. [2024-11-17 08:11:59,310 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 161 [2024-11-17 08:11:59,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:59,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:59,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 5, 4, 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] [2024-11-17 08:11:59,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:59,311 INFO L745 eck$LassoCheckResult]: Stem: 25964#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 25965#ULTIMATE.init_returnLabel#1 assume true;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; 25956#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; 25957#L40-1 assume true; 25977#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 25978#L40-1 assume true; 25934#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 25935#L40-1 assume true; 25995#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 25994#L40-1 assume true; 25993#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 25984#L40-1 assume true; 25932#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 25933#L40 havoc main_~i~1#1; 25918#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 25926#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26076#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); 25930#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26073#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26070#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); 26064#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26067#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26075#L24 assume ~n#1 < 2; 26074#merge_sortFINAL assume true; 26063#merge_sortEXIT >#52#return; 26052#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26053#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26060#L24 assume ~n#1 < 2; 26054#merge_sortFINAL assume true; 26057#merge_sortEXIT >#50#return; 26047#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; 26048#L11 assume true; 26041#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26042#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 26032#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 26033#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 26024#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 26025#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 26016#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26017#L11 assume true; 26008#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26009#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 26004#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26002#L11 assume true; 26003#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 25998#L17-2 merge_~i~0#1 := 0; 25999#L17 assume true; 26212#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26213#L17 assume true; 25929#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 25931#L17 assume true; 26138#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 26139#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 26127#merge_returnLabel#1 assume true;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; 26128#merge_sortFINAL assume true; 25948#merge_sortEXIT >#52#return; 25949#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 25959#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26079#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); 25910#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 25906#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 25911#L24 assume ~n#1 < 2; 25975#merge_sortFINAL assume true; 26083#merge_sortEXIT >#52#return; 26082#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26089#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26087#L24 assume ~n#1 < 2; 25975#merge_sortFINAL assume true; 26083#merge_sortEXIT >#50#return; 26086#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; 26236#L11 assume true; 26235#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26232#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 26230#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 26228#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 26226#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 26224#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 26222#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26220#L11 assume true; 26218#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26216#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 26215#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26214#L11 assume true; 26211#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 26210#L17-2 merge_~i~0#1 := 0; 26209#L17 assume true; 26208#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26207#L17 assume true; 26206#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26204#L17 [2024-11-17 08:11:59,311 INFO L747 eck$LassoCheckResult]: Loop: 26204#L17 assume true; 26205#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26204#L17 [2024-11-17 08:11:59,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 166368068, now seen corresponding path program 7 times [2024-11-17 08:11:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:59,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507753654] [2024-11-17 08:11:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:59,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:59,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:59,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:59,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 5 times [2024-11-17 08:11:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:59,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307916952] [2024-11-17 08:11:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:59,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:59,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:59,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash 965923587, now seen corresponding path program 8 times [2024-11-17 08:11:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282847800] [2024-11-17 08:11:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-17 08:11:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:59,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:11:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:59,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:11:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 08:11:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:59,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-17 08:11:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 60 proven. 44 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-17 08:11:59,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282847800] [2024-11-17 08:11:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282847800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750861196] [2024-11-17 08:11:59,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:11:59,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:59,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:59,891 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:59,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2024-11-17 08:12:00,107 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:12:00,107 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:12:00,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-17 08:12:00,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-17 08:12:00,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-17 08:12:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750861196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:00,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:00,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 27 [2024-11-17 08:12:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138107058] [2024-11-17 08:12:00,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:00,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 08:12:00,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2024-11-17 08:12:00,602 INFO L87 Difference]: Start difference. First operand 760 states and 915 transitions. cyclomatic complexity: 192 Second operand has 28 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 23 states have internal predecessors, (94), 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-17 08:12:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:01,227 INFO L93 Difference]: Finished difference Result 1026 states and 1212 transitions. [2024-11-17 08:12:01,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1026 states and 1212 transitions. [2024-11-17 08:12:01,233 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 204 [2024-11-17 08:12:01,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1026 states to 987 states and 1170 transitions. [2024-11-17 08:12:01,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 869 [2024-11-17 08:12:01,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 873 [2024-11-17 08:12:01,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 987 states and 1170 transitions. [2024-11-17 08:12:01,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:01,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 987 states and 1170 transitions. [2024-11-17 08:12:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states and 1170 transitions. [2024-11-17 08:12:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 859. [2024-11-17 08:12:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 809 states have (on average 1.138442521631644) internal successors, (921), 806 states have internal predecessors, (921), 33 states have call successors, (35), 22 states have call predecessors, (35), 17 states have return successors, (61), 30 states have call predecessors, (61), 30 states have call successors, (61) [2024-11-17 08:12:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1017 transitions. [2024-11-17 08:12:01,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 859 states and 1017 transitions. [2024-11-17 08:12:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 08:12:01,257 INFO L425 stractBuchiCegarLoop]: Abstraction has 859 states and 1017 transitions. [2024-11-17 08:12:01,257 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2024-11-17 08:12:01,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 859 states and 1017 transitions. [2024-11-17 08:12:01,261 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 161 [2024-11-17 08:12:01,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:01,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:01,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 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] [2024-11-17 08:12:01,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:12:01,263 INFO L745 eck$LassoCheckResult]: Stem: 28412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 28413#ULTIMATE.init_returnLabel#1 assume true;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; 28402#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; 28403#L40-1 assume true; 28428#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28429#L40-1 assume true; 28381#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28382#L40-1 assume true; 28450#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28449#L40-1 assume true; 28448#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28438#L40-1 assume true; 28439#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28446#L40-1 assume true; 28447#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 28433#L40 havoc main_~i~1#1; 28365#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 28513#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28512#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); 28501#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28510#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28506#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); 28498#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28502#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28508#L24 assume ~n#1 < 2; 28504#merge_sortFINAL assume true; 28497#merge_sortEXIT >#52#return; 28489#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28493#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28494#L24 assume ~n#1 < 2; 28488#merge_sortFINAL assume true; 28490#merge_sortEXIT >#50#return; 28514#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; 28615#L11 assume true; 28612#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28607#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 28603#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28599#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 28594#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 28589#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 28585#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28582#L11 assume true; 28579#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28576#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 28574#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28572#L11 assume true; 28570#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 28568#L17-2 merge_~i~0#1 := 0; 28566#L17 assume true; 28564#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28562#L17 assume true; 28557#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28556#L17 assume true; 28553#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 28551#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 28550#merge_returnLabel#1 assume true;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; 28548#merge_sortFINAL assume true; 28539#merge_sortEXIT >#52#return; 28405#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28546#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28535#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); 28404#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28406#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28423#L24 assume ~n#1 < 2; 28427#merge_sortFINAL assume true; 28654#merge_sortEXIT >#52#return; 28519#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28517#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28520#L24 assume ~n#1 < 2; 28427#merge_sortFINAL assume true; 28654#merge_sortEXIT >#50#return; 28725#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; 28788#L11 assume true; 28787#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28784#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 28782#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28780#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 28778#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 28776#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 28774#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28772#L11 assume true; 28770#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28768#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 28767#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28766#L11 assume true; 28765#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 28764#L17-2 merge_~i~0#1 := 0; 28763#L17 assume true; 28762#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28761#L17 assume true; 28760#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28758#L17 [2024-11-17 08:12:01,264 INFO L747 eck$LassoCheckResult]: Loop: 28758#L17 assume true; 28759#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28758#L17 [2024-11-17 08:12:01,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1208475741, now seen corresponding path program 9 times [2024-11-17 08:12:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289201309] [2024-11-17 08:12:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-17 08:12:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:12:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:12:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 08:12:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:01,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-17 08:12:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 80 proven. 40 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-17 08:12:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:01,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289201309] [2024-11-17 08:12:01,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289201309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:01,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801814937] [2024-11-17 08:12:01,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:12:01,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:01,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:01,688 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:01,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2024-11-17 08:12:01,914 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 08:12:01,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:12:01,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:12:01,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 73 proven. 37 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-17 08:12:02,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 73 proven. 37 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-17 08:12:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801814937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:02,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:02,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 27 [2024-11-17 08:12:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184878676] [2024-11-17 08:12:02,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:02,226 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 6 times [2024-11-17 08:12:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487050241] [2024-11-17 08:12:02,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:02,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:02,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-17 08:12:02,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2024-11-17 08:12:02,297 INFO L87 Difference]: Start difference. First operand 859 states and 1017 transitions. cyclomatic complexity: 195 Second operand has 27 states, 23 states have (on average 4.130434782608695) internal successors, (95), 23 states have internal predecessors, (95), 7 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-17 08:12:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:02,892 INFO L93 Difference]: Finished difference Result 1277 states and 1508 transitions. [2024-11-17 08:12:02,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1277 states and 1508 transitions. [2024-11-17 08:12:02,900 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 257 [2024-11-17 08:12:02,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1277 states to 1277 states and 1508 transitions. [2024-11-17 08:12:02,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1095 [2024-11-17 08:12:02,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1095 [2024-11-17 08:12:02,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1277 states and 1508 transitions. [2024-11-17 08:12:02,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:02,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1277 states and 1508 transitions. [2024-11-17 08:12:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states and 1508 transitions. [2024-11-17 08:12:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1015. [2024-11-17 08:12:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 962 states have (on average 1.1465696465696467) internal successors, (1103), 959 states have internal predecessors, (1103), 35 states have call successors, (37), 22 states have call predecessors, (37), 18 states have return successors, (62), 33 states have call predecessors, (62), 32 states have call successors, (62) [2024-11-17 08:12:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1202 transitions. [2024-11-17 08:12:02,928 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1202 transitions. [2024-11-17 08:12:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-17 08:12:02,929 INFO L425 stractBuchiCegarLoop]: Abstraction has 1015 states and 1202 transitions. [2024-11-17 08:12:02,929 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2024-11-17 08:12:02,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1015 states and 1202 transitions. [2024-11-17 08:12:02,934 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 202 [2024-11-17 08:12:02,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:02,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:02,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:12:02,935 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:12:02,936 INFO L745 eck$LassoCheckResult]: Stem: 31219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 31220#ULTIMATE.init_returnLabel#1 assume true;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; 31206#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; 31207#L40-1 assume true; 31228#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31229#L40-1 assume true; 31191#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31192#L40-1 assume true; 31248#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31247#L40-1 assume true; 31246#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31236#L40-1 assume true; 31237#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31245#L40-1 assume true; 31244#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31243#L40-1 assume true; 31242#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 31241#L40 havoc main_~i~1#1; 31164#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 31239#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31240#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); 31174#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31173#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31175#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); 31184#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31302#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31312#L24 assume ~n#1 < 2; 31310#merge_sortFINAL assume true; 31298#merge_sortEXIT >#52#return; 31187#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 31307#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31304#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); 31297#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31300#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31306#L24 assume ~n#1 < 2; 31303#merge_sortFINAL assume true; 31296#merge_sortEXIT >#52#return; 31286#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 31288#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31292#L24 assume ~n#1 < 2; 31293#merge_sortFINAL assume true; 31285#merge_sortEXIT >#50#return; 31287#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; 31491#L11 assume true; 31489#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31487#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 31485#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31483#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 31481#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 31479#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 31266#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31264#L11 assume true; 31260#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31261#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 31417#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31255#L11 assume true; 31253#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 31254#L17-2 merge_~i~0#1 := 0; 31249#L17 assume true; 31183#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 31188#L17 assume true; 31221#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 31401#L17 assume true; 31386#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 31383#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 31380#merge_returnLabel#1 assume true;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; 31376#merge_sortFINAL assume true; 31368#merge_sortEXIT >#50#return; 31373#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; 31879#L11 assume true; 31877#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31873#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 31871#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31869#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 31867#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 31865#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 31863#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31861#L11 assume true; 31851#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31852#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 31846#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 31847#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 31842#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31843#L11 assume true; 31358#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31359#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 31909#L13-1 [2024-11-17 08:12:02,936 INFO L747 eck$LassoCheckResult]: Loop: 31909#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 31910#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 31822#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31823#L11 assume true; 31827#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31828#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 31909#L13-1 [2024-11-17 08:12:02,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash -187535115, now seen corresponding path program 6 times [2024-11-17 08:12:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474832096] [2024-11-17 08:12:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:02,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:03,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:03,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:03,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1241500169, now seen corresponding path program 4 times [2024-11-17 08:12:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:03,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057238579] [2024-11-17 08:12:03,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:03,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:03,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:03,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash -22105091, now seen corresponding path program 7 times [2024-11-17 08:12:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462650770] [2024-11-17 08:12:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-17 08:12:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:03,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 08:12:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:12:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:12:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 62 proven. 76 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-17 08:12:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462650770] [2024-11-17 08:12:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462650770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682545853] [2024-11-17 08:12:03,491 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-17 08:12:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:03,495 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:03,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2024-11-17 08:12:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:03,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 08:12:03,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 40 proven. 51 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-17 08:12:04,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 39 proven. 55 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-17 08:12:04,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682545853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:04,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:04,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 13] total 33 [2024-11-17 08:12:04,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501944841] [2024-11-17 08:12:04,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-17 08:12:04,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2024-11-17 08:12:04,521 INFO L87 Difference]: Start difference. First operand 1015 states and 1202 transitions. cyclomatic complexity: 231 Second operand has 33 states, 29 states have (on average 4.517241379310345) internal successors, (131), 27 states have internal predecessors, (131), 9 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-17 08:12:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:05,433 INFO L93 Difference]: Finished difference Result 2004 states and 2399 transitions. [2024-11-17 08:12:05,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2004 states and 2399 transitions. [2024-11-17 08:12:05,443 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 373 [2024-11-17 08:12:05,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2004 states to 1980 states and 2375 transitions. [2024-11-17 08:12:05,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1699 [2024-11-17 08:12:05,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1813 [2024-11-17 08:12:05,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1980 states and 2375 transitions. [2024-11-17 08:12:05,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:05,456 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1980 states and 2375 transitions. [2024-11-17 08:12:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states and 2375 transitions. [2024-11-17 08:12:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1292. [2024-11-17 08:12:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1227 states have (on average 1.1361043194784026) internal successors, (1394), 1222 states have internal predecessors, (1394), 44 states have call successors, (47), 25 states have call predecessors, (47), 21 states have return successors, (87), 44 states have call predecessors, (87), 40 states have call successors, (87) [2024-11-17 08:12:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1528 transitions. [2024-11-17 08:12:05,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1292 states and 1528 transitions. [2024-11-17 08:12:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-17 08:12:05,486 INFO L425 stractBuchiCegarLoop]: Abstraction has 1292 states and 1528 transitions. [2024-11-17 08:12:05,486 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2024-11-17 08:12:05,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1292 states and 1528 transitions. [2024-11-17 08:12:05,490 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 190 [2024-11-17 08:12:05,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:05,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:05,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:12:05,491 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:12:05,491 INFO L745 eck$LassoCheckResult]: Stem: 34955#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 34956#ULTIMATE.init_returnLabel#1 assume true;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; 34944#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; 34945#L40-1 assume true; 34969#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 34992#L40-1 assume true; 34989#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 34990#L40-1 assume true; 34993#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 34970#L40-1 assume true; 34929#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 34930#L40-1 assume true; 34994#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 34986#L40-1 assume true; 34988#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 34977#L40-1 assume true; 34979#L40-2 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 34991#L40-1 assume true; 34984#L40-2 assume !(main_~i~1#1 < main_~n~0#1); 34985#L40 havoc main_~i~1#1; 34922#L44-1 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 34982#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35059#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); 34895#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 34894#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 34896#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); 34910#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35060#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 34968#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); 34909#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35060#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35058#L24 assume ~n#1 < 2; 35056#merge_sortFINAL assume true; 35043#merge_sortEXIT >#52#return; 35000#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35053#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35050#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); 35042#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35045#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35052#L24 assume ~n#1 < 2; 35049#merge_sortFINAL assume true; 35041#merge_sortEXIT >#52#return; 35032#L28-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35033#merge_sortENTRY ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35037#L24 assume ~n#1 < 2; 35038#merge_sortFINAL assume true; 35031#merge_sortEXIT >#50#return; 35030#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; 35029#L11 assume true; 35027#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 35024#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 35022#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35020#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 35017#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 35018#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 35012#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35009#L11 assume true; 35010#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 35243#L12-2 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 35241#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35239#L11 assume true; 34997#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 35001#L17-2 merge_~i~0#1 := 0; 35236#L17 assume true; 35234#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35232#L17 assume true; 35229#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35228#L17 assume true; 35120#L17-1 assume !(merge_~i~0#1 < merge_~n#1); 35118#L20 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35116#merge_returnLabel#1 assume true;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; 35114#merge_sortFINAL assume true; 35105#merge_sortEXIT >#50#return; 35111#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; 35614#L11 assume true; 35613#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 35611#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 35612#L13-1 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35630#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 35628#L13 merge_#t~ite13#1 := merge_#t~ite12#1; 35626#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 35624#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35622#L11 assume true; 35619#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 35617#L12-2 assume !(merge_~j~0#1 == merge_~n#1); 35618#L13-1 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 35627#L12-1 merge_#t~ite14#1 := merge_#t~ite13#1; 35625#L12 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 35623#L11 assume true; 35620#L11-1 assume !(merge_~k~0#1 < merge_~n#1); 35587#L17-2 merge_~i~0#1 := 0; 35586#L17 assume true; 35585#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35584#L17 assume true; 35583#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35582#L17 [2024-11-17 08:12:05,492 INFO L747 eck$LassoCheckResult]: Loop: 35582#L17 assume true; 35581#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 35582#L17 [2024-11-17 08:12:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash -166465020, now seen corresponding path program 8 times [2024-11-17 08:12:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009668069] [2024-11-17 08:12:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:06,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 08:12:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-17 08:12:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 08:12:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-17 08:12:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 62 proven. 94 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 08:12:06,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:06,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009668069] [2024-11-17 08:12:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009668069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:06,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196359000] [2024-11-17 08:12:06,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:12:06,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:06,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:06,274 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:06,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2024-11-17 08:12:06,519 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:12:06,519 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:12:06,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 08:12:06,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 20 proven. 73 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-17 08:12:06,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 20 proven. 73 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-17 08:12:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196359000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:07,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13, 13] total 46 [2024-11-17 08:12:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085706470] [2024-11-17 08:12:07,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:07,238 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:07,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:07,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1152, now seen corresponding path program 7 times [2024-11-17 08:12:07,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:07,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133838504] [2024-11-17 08:12:07,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:07,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:07,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:07,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:07,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-17 08:12:07,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1916, Unknown=0, NotChecked=0, Total=2070 [2024-11-17 08:12:07,310 INFO L87 Difference]: Start difference. First operand 1292 states and 1528 transitions. cyclomatic complexity: 278 Second operand has 46 states, 43 states have (on average 3.13953488372093) internal successors, (135), 38 states have internal predecessors, (135), 10 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10)